./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta --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 eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 17:39:56,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 17:39:56,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 17:39:56,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 17:39:56,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 17:39:56,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 17:39:56,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 17:39:56,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 17:39:56,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 17:39:56,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 17:39:56,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 17:39:56,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 17:39:56,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 17:39:56,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 17:39:56,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 17:39:56,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 17:39:56,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 17:39:56,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 17:39:56,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 17:39:56,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 17:39:56,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 17:39:56,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 17:39:56,244 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 17:39:56,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 17:39:56,255 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 17:39:56,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 17:39:56,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 17:39:56,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 17:39:56,258 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 17:39:56,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 17:39:56,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 17:39:56,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 17:39:56,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 17:39:56,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 17:39:56,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 17:39:56,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 17:39:56,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 17:39:56,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 17:39:56,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 17:39:56,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 17:39:56,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 17:39:56,269 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-10-17 17:39:56,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 17:39:56,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 17:39:56,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 17:39:56,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 17:39:56,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 17:39:56,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 17:39:56,310 INFO L138 SettingsManager]: * User list type=DISABLED [2022-10-17 17:39:56,310 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-10-17 17:39:56,310 INFO L138 SettingsManager]: * Explicit value domain=true [2022-10-17 17:39:56,311 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-10-17 17:39:56,311 INFO L138 SettingsManager]: * Octagon Domain=false [2022-10-17 17:39:56,311 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-10-17 17:39:56,312 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-10-17 17:39:56,312 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-10-17 17:39:56,312 INFO L138 SettingsManager]: * Interval Domain=false [2022-10-17 17:39:56,313 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-10-17 17:39:56,313 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-10-17 17:39:56,314 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-10-17 17:39:56,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 17:39:56,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 17:39:56,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 17:39:56,316 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 17:39:56,316 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 17:39:56,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 17:39:56,317 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 17:39:56,317 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 17:39:56,317 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 17:39:56,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 17:39:56,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 17:39:56,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 17:39:56,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 17:39:56,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 17:39:56,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:39:56,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 17:39:56,323 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-10-17 17:39:56,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 17:39:56,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 17:39:56,325 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-10-17 17:39:56,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 17:39:56,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 17:39:56,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-10-17 17:39:56,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/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_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta 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 -> eb14ef07a6b26c4855460091e3932f356dd44c86cf5744c08658c1a06a447e8e [2022-10-17 17:39:56,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 17:39:56,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 17:39:56,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 17:39:56,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 17:39:56,610 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 17:39:56,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/../../sv-benchmarks/c/pthread-wmm/mix033.opt.i [2022-10-17 17:39:56,680 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/data/2927a29e0/34b30dab9c8445e3b89599b00781444d/FLAGb48bb9fda [2022-10-17 17:39:57,191 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 17:39:57,192 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/sv-benchmarks/c/pthread-wmm/mix033.opt.i [2022-10-17 17:39:57,209 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/data/2927a29e0/34b30dab9c8445e3b89599b00781444d/FLAGb48bb9fda [2022-10-17 17:39:57,696 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/data/2927a29e0/34b30dab9c8445e3b89599b00781444d [2022-10-17 17:39:57,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 17:39:57,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 17:39:57,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 17:39:57,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 17:39:57,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 17:39:57,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:39:57" (1/1) ... [2022-10-17 17:39:57,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16510546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:57, skipping insertion in model container [2022-10-17 17:39:57,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 05:39:57" (1/1) ... [2022-10-17 17:39:57,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 17:39:57,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 17:39:58,067 WARN L230 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_be8f396a-49c9-4b37-ac95-d16b921cb97f/sv-benchmarks/c/pthread-wmm/mix033.opt.i[944,957] [2022-10-17 17:39:58,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:39:58,405 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 17:39:58,423 WARN L230 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_be8f396a-49c9-4b37-ac95-d16b921cb97f/sv-benchmarks/c/pthread-wmm/mix033.opt.i[944,957] [2022-10-17 17:39:58,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 17:39:58,554 INFO L208 MainTranslator]: Completed translation [2022-10-17 17:39:58,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58 WrapperNode [2022-10-17 17:39:58,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 17:39:58,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 17:39:58,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 17:39:58,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 17:39:58,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,620 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 186 [2022-10-17 17:39:58,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 17:39:58,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 17:39:58,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 17:39:58,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 17:39:58,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,651 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,655 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 17:39:58,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 17:39:58,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 17:39:58,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 17:39:58,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (1/1) ... [2022-10-17 17:39:58,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 17:39:58,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/z3 [2022-10-17 17:39:58,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 17:39:58,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 17:39:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 17:39:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 17:39:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 17:39:58,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 17:39:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 17:39:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 17:39:58,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 17:39:58,774 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 17:39:58,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 17:39:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 17:39:58,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 17:39:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 17:39:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 17:39:58,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 17:39:58,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 17:39:58,777 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 17:39:58,920 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 17:39:58,930 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 17:39:59,689 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 17:40:00,105 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 17:40:00,105 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 17:40:00,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:40:00 BoogieIcfgContainer [2022-10-17 17:40:00,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 17:40:00,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 17:40:00,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 17:40:00,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 17:40:00,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 05:39:57" (1/3) ... [2022-10-17 17:40:00,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd098a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:40:00, skipping insertion in model container [2022-10-17 17:40:00,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 05:39:58" (2/3) ... [2022-10-17 17:40:00,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd098a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 05:40:00, skipping insertion in model container [2022-10-17 17:40:00,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:40:00" (3/3) ... [2022-10-17 17:40:00,119 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2022-10-17 17:40:00,129 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 17:40:00,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 17:40:00,142 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 17:40:00,142 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 17:40:00,207 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 17:40:00,244 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-10-17 17:40:00,259 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 257 flow [2022-10-17 17:40:00,262 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 257 flow [2022-10-17 17:40:00,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2022-10-17 17:40:00,322 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2022-10-17 17:40:00,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 17:40:00,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-10-17 17:40:00,329 INFO L118 LiptonReduction]: Number of co-enabled transitions 2240 [2022-10-17 17:40:06,072 INFO L133 LiptonReduction]: Checked pairs total: 5515 [2022-10-17 17:40:06,073 INFO L135 LiptonReduction]: Total number of compositions: 106 [2022-10-17 17:40:06,083 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2022-10-17 17:40:06,187 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 790 states, 787 states have (on average 3.335451080050826) internal successors, (2625), 789 states have internal predecessors, (2625), 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) [2022-10-17 17:40:06,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 17:40:06,219 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@dfa371a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 17:40:06,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 17:40:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 790 states, 787 states have (on average 3.335451080050826) internal successors, (2625), 789 states have internal predecessors, (2625), 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) [2022-10-17 17:40:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-17 17:40:06,233 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:06,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:06,234 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash 499346093, now seen corresponding path program 1 times [2022-10-17 17:40:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:06,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714595385] [2022-10-17 17:40:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:06,858 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:06,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714595385] [2022-10-17 17:40:06,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714595385] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:06,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:06,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-10-17 17:40:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280813853] [2022-10-17 17:40:06,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:06,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:40:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:40:06,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:40:06,905 INFO L87 Difference]: Start difference. First operand has 790 states, 787 states have (on average 3.335451080050826) internal successors, (2625), 789 states have internal predecessors, (2625), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-10-17 17:40:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:07,018 INFO L93 Difference]: Finished difference Result 670 states and 2079 transitions. [2022-10-17 17:40:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:40:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-10-17 17:40:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:07,044 INFO L225 Difference]: With dead ends: 670 [2022-10-17 17:40:07,044 INFO L226 Difference]: Without dead ends: 650 [2022-10-17 17:40:07,045 INFO L412 NwaCegarLoop]: 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 [2022-10-17 17:40:07,049 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:07,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2022-10-17 17:40:07,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2022-10-17 17:40:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 3.1248073959938365) internal successors, (2028), 649 states have internal predecessors, (2028), 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) [2022-10-17 17:40:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 2028 transitions. [2022-10-17 17:40:07,187 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 2028 transitions. Word has length 7 [2022-10-17 17:40:07,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:07,188 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 2028 transitions. [2022-10-17 17:40:07,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2022-10-17 17:40:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 2028 transitions. [2022-10-17 17:40:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-17 17:40:07,192 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:07,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:07,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 17:40:07,193 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:07,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1745245490, now seen corresponding path program 1 times [2022-10-17 17:40:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:07,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592170086] [2022-10-17 17:40:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:07,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:07,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:07,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592170086] [2022-10-17 17:40:07,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592170086] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:07,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:07,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:40:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817088712] [2022-10-17 17:40:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:07,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:40:07,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:07,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:40:07,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:40:07,597 INFO L87 Difference]: Start difference. First operand 650 states and 2028 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-10-17 17:40:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:07,808 INFO L93 Difference]: Finished difference Result 1106 states and 3230 transitions. [2022-10-17 17:40:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:40:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-10-17 17:40:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:07,821 INFO L225 Difference]: With dead ends: 1106 [2022-10-17 17:40:07,822 INFO L226 Difference]: Without dead ends: 894 [2022-10-17 17:40:07,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:07,825 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:07,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 17:40:07,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2022-10-17 17:40:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 782. [2022-10-17 17:40:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 781 states have (on average 3.032010243277849) internal successors, (2368), 781 states have internal predecessors, (2368), 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) [2022-10-17 17:40:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 2368 transitions. [2022-10-17 17:40:07,876 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 2368 transitions. Word has length 10 [2022-10-17 17:40:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:07,876 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 2368 transitions. [2022-10-17 17:40:07,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-10-17 17:40:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 2368 transitions. [2022-10-17 17:40:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-17 17:40:07,885 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:07,885 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:07,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 17:40:07,886 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:07,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash 286816388, now seen corresponding path program 1 times [2022-10-17 17:40:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:07,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260716906] [2022-10-17 17:40:07,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:08,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:08,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260716906] [2022-10-17 17:40:08,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260716906] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:08,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:08,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:40:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218379090] [2022-10-17 17:40:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:08,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:40:08,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:08,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:40:08,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:08,136 INFO L87 Difference]: Start difference. First operand 782 states and 2368 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-10-17 17:40:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:08,330 INFO L93 Difference]: Finished difference Result 926 states and 2668 transitions. [2022-10-17 17:40:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 17:40:08,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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 [2022-10-17 17:40:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:08,342 INFO L225 Difference]: With dead ends: 926 [2022-10-17 17:40:08,342 INFO L226 Difference]: Without dead ends: 798 [2022-10-17 17:40:08,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:40:08,343 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 46 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:08,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 17 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-10-17 17:40:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 654. [2022-10-17 17:40:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 3.013782542113323) internal successors, (1968), 653 states have internal predecessors, (1968), 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) [2022-10-17 17:40:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1968 transitions. [2022-10-17 17:40:08,377 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1968 transitions. Word has length 11 [2022-10-17 17:40:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:08,377 INFO L495 AbstractCegarLoop]: Abstraction has 654 states and 1968 transitions. [2022-10-17 17:40:08,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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) [2022-10-17 17:40:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1968 transitions. [2022-10-17 17:40:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-17 17:40:08,379 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:08,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:08,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 17:40:08,380 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1974164283, now seen corresponding path program 1 times [2022-10-17 17:40:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:08,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006396089] [2022-10-17 17:40:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:08,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:08,595 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:08,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006396089] [2022-10-17 17:40:08,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006396089] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:08,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:08,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:40:08,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758821193] [2022-10-17 17:40:08,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:08,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:40:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:08,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:40:08,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:40:08,603 INFO L87 Difference]: Start difference. First operand 654 states and 1968 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2022-10-17 17:40:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:08,723 INFO L93 Difference]: Finished difference Result 718 states and 2100 transitions. [2022-10-17 17:40:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:40:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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 [2022-10-17 17:40:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:08,729 INFO L225 Difference]: With dead ends: 718 [2022-10-17 17:40:08,730 INFO L226 Difference]: Without dead ends: 638 [2022-10-17 17:40:08,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:08,731 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:08,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 16 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-10-17 17:40:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2022-10-17 17:40:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 637 states have (on average 2.9952904238618525) internal successors, (1908), 637 states have internal predecessors, (1908), 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) [2022-10-17 17:40:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1908 transitions. [2022-10-17 17:40:08,759 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1908 transitions. Word has length 12 [2022-10-17 17:40:08,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:08,759 INFO L495 AbstractCegarLoop]: Abstraction has 638 states and 1908 transitions. [2022-10-17 17:40:08,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2022-10-17 17:40:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1908 transitions. [2022-10-17 17:40:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-17 17:40:08,761 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:08,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:08,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 17:40:08,762 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:08,762 INFO L85 PathProgramCache]: Analyzing trace with hash 575509361, now seen corresponding path program 1 times [2022-10-17 17:40:08,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:08,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826763577] [2022-10-17 17:40:08,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:08,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826763577] [2022-10-17 17:40:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826763577] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:08,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:08,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:40:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910023936] [2022-10-17 17:40:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:08,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:40:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:08,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:40:08,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:40:08,908 INFO L87 Difference]: Start difference. First operand 638 states and 1908 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) [2022-10-17 17:40:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:09,018 INFO L93 Difference]: Finished difference Result 662 states and 1930 transitions. [2022-10-17 17:40:09,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:40:09,019 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 [2022-10-17 17:40:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:09,024 INFO L225 Difference]: With dead ends: 662 [2022-10-17 17:40:09,024 INFO L226 Difference]: Without dead ends: 590 [2022-10-17 17:40:09,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:09,025 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:09,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 16 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-10-17 17:40:09,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 542. [2022-10-17 17:40:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 2.9648798521256934) internal successors, (1604), 541 states have internal predecessors, (1604), 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) [2022-10-17 17:40:09,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1604 transitions. [2022-10-17 17:40:09,048 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1604 transitions. Word has length 13 [2022-10-17 17:40:09,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:09,048 INFO L495 AbstractCegarLoop]: Abstraction has 542 states and 1604 transitions. [2022-10-17 17:40:09,048 INFO L496 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) [2022-10-17 17:40:09,049 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1604 transitions. [2022-10-17 17:40:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-17 17:40:09,050 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:09,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:09,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 17:40:09,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:09,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:09,051 INFO L85 PathProgramCache]: Analyzing trace with hash 309082531, now seen corresponding path program 1 times [2022-10-17 17:40:09,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:09,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373405135] [2022-10-17 17:40:09,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:09,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:09,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:09,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:09,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373405135] [2022-10-17 17:40:09,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373405135] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:09,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:09,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 17:40:09,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327749787] [2022-10-17 17:40:09,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:09,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 17:40:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 17:40:09,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 17:40:09,225 INFO L87 Difference]: Start difference. First operand 542 states and 1604 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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) [2022-10-17 17:40:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:09,281 INFO L93 Difference]: Finished difference Result 378 states and 952 transitions. [2022-10-17 17:40:09,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 17:40:09,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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 [2022-10-17 17:40:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:09,284 INFO L225 Difference]: With dead ends: 378 [2022-10-17 17:40:09,284 INFO L226 Difference]: Without dead ends: 378 [2022-10-17 17:40:09,285 INFO L412 NwaCegarLoop]: 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 [2022-10-17 17:40:09,285 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:09,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 17:40:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-10-17 17:40:09,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-10-17 17:40:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 377 states have (on average 2.5251989389920424) internal successors, (952), 377 states have internal predecessors, (952), 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) [2022-10-17 17:40:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 952 transitions. [2022-10-17 17:40:09,300 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 952 transitions. Word has length 14 [2022-10-17 17:40:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:09,301 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 952 transitions. [2022-10-17 17:40:09,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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) [2022-10-17 17:40:09,301 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 952 transitions. [2022-10-17 17:40:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-17 17:40:09,302 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:09,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:09,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 17:40:09,303 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2031087715, now seen corresponding path program 1 times [2022-10-17 17:40:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:09,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186698885] [2022-10-17 17:40:09,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:09,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:09,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:09,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186698885] [2022-10-17 17:40:09,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186698885] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:09,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:09,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 17:40:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937207676] [2022-10-17 17:40:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:09,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-17 17:40:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-17 17:40:09,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:40:09,541 INFO L87 Difference]: Start difference. First operand 378 states and 952 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) [2022-10-17 17:40:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:09,620 INFO L93 Difference]: Finished difference Result 230 states and 514 transitions. [2022-10-17 17:40:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-17 17:40:09,620 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 [2022-10-17 17:40:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:09,622 INFO L225 Difference]: With dead ends: 230 [2022-10-17 17:40:09,622 INFO L226 Difference]: Without dead ends: 230 [2022-10-17 17:40:09,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-17 17:40:09,623 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:09,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-10-17 17:40:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2022-10-17 17:40:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.2422907488986783) internal successors, (509), 227 states have internal predecessors, (509), 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) [2022-10-17 17:40:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 509 transitions. [2022-10-17 17:40:09,632 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 509 transitions. Word has length 16 [2022-10-17 17:40:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:09,633 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 509 transitions. [2022-10-17 17:40:09,633 INFO L496 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) [2022-10-17 17:40:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 509 transitions. [2022-10-17 17:40:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-17 17:40:09,634 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:09,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:09,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 17:40:09,634 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:09,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:09,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2037085508, now seen corresponding path program 1 times [2022-10-17 17:40:09,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:09,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771980152] [2022-10-17 17:40:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:09,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:09,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771980152] [2022-10-17 17:40:09,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771980152] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:09,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:09,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:40:09,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191125673] [2022-10-17 17:40:09,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:09,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:40:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:09,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:40:09,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:09,865 INFO L87 Difference]: Start difference. First operand 228 states and 509 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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) [2022-10-17 17:40:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:09,944 INFO L93 Difference]: Finished difference Result 184 states and 423 transitions. [2022-10-17 17:40:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:40:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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 [2022-10-17 17:40:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:09,946 INFO L225 Difference]: With dead ends: 184 [2022-10-17 17:40:09,947 INFO L226 Difference]: Without dead ends: 172 [2022-10-17 17:40:09,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:09,948 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 57 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:09,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 11 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-10-17 17:40:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-10-17 17:40:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.31055900621118) internal successors, (372), 161 states have internal predecessors, (372), 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) [2022-10-17 17:40:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 372 transitions. [2022-10-17 17:40:09,954 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 372 transitions. Word has length 19 [2022-10-17 17:40:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:09,955 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 372 transitions. [2022-10-17 17:40:09,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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) [2022-10-17 17:40:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 372 transitions. [2022-10-17 17:40:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-17 17:40:09,956 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:09,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:09,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 17:40:09,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash -541305874, now seen corresponding path program 1 times [2022-10-17 17:40:09,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:09,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077931937] [2022-10-17 17:40:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:09,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:10,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:10,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077931937] [2022-10-17 17:40:10,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077931937] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:10,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:10,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:40:10,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627608535] [2022-10-17 17:40:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:10,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:40:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:40:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:10,193 INFO L87 Difference]: Start difference. First operand 162 states and 372 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2022-10-17 17:40:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:10,323 INFO L93 Difference]: Finished difference Result 204 states and 455 transitions. [2022-10-17 17:40:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:40:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 [2022-10-17 17:40:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:10,325 INFO L225 Difference]: With dead ends: 204 [2022-10-17 17:40:10,325 INFO L226 Difference]: Without dead ends: 71 [2022-10-17 17:40:10,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-17 17:40:10,326 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:10,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-10-17 17:40:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-10-17 17:40:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 70 states have internal predecessors, (134), 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) [2022-10-17 17:40:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2022-10-17 17:40:10,330 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 22 [2022-10-17 17:40:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:10,330 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2022-10-17 17:40:10,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2022-10-17 17:40:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2022-10-17 17:40:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-17 17:40:10,331 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:10,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:10,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 17:40:10,332 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash -84737502, now seen corresponding path program 2 times [2022-10-17 17:40:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:10,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562225157] [2022-10-17 17:40:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:10,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:10,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562225157] [2022-10-17 17:40:10,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562225157] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:10,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:10,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-17 17:40:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078313689] [2022-10-17 17:40:10,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:10,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 17:40:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:10,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 17:40:10,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-17 17:40:10,630 INFO L87 Difference]: Start difference. First operand 71 states and 134 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2022-10-17 17:40:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:10,726 INFO L93 Difference]: Finished difference Result 98 states and 183 transitions. [2022-10-17 17:40:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 17:40:10,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 [2022-10-17 17:40:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:10,728 INFO L225 Difference]: With dead ends: 98 [2022-10-17 17:40:10,728 INFO L226 Difference]: Without dead ends: 49 [2022-10-17 17:40:10,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:40:10,729 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:10,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 10 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-17 17:40:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-17 17:40:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 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) [2022-10-17 17:40:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 82 transitions. [2022-10-17 17:40:10,732 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 82 transitions. Word has length 22 [2022-10-17 17:40:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:10,732 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 82 transitions. [2022-10-17 17:40:10,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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) [2022-10-17 17:40:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 82 transitions. [2022-10-17 17:40:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-17 17:40:10,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:10,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:10,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 17:40:10,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:10,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1065788800, now seen corresponding path program 3 times [2022-10-17 17:40:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:10,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167539023] [2022-10-17 17:40:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 17:40:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 17:40:11,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-10-17 17:40:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167539023] [2022-10-17 17:40:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167539023] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 17:40:11,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 17:40:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 17:40:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96107082] [2022-10-17 17:40:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 17:40:11,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 17:40:11,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-10-17 17:40:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 17:40:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 17:40:11,586 INFO L87 Difference]: Start difference. First operand 49 states and 82 transitions. Second operand has 6 states, 5 states have (on average 4.4) 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) [2022-10-17 17:40:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 17:40:11,713 INFO L93 Difference]: Finished difference Result 60 states and 97 transitions. [2022-10-17 17:40:11,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 17:40:11,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) 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 [2022-10-17 17:40:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 17:40:11,715 INFO L225 Difference]: With dead ends: 60 [2022-10-17 17:40:11,715 INFO L226 Difference]: Without dead ends: 33 [2022-10-17 17:40:11,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-10-17 17:40:11,716 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 17:40:11,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 17:40:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-17 17:40:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-17 17:40:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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) [2022-10-17 17:40:11,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-10-17 17:40:11,718 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 22 [2022-10-17 17:40:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 17:40:11,718 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-10-17 17:40:11,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) 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) [2022-10-17 17:40:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-10-17 17:40:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-17 17:40:11,719 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 17:40:11,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:11,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 17:40:11,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 17:40:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 17:40:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1132252092, now seen corresponding path program 4 times [2022-10-17 17:40:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-10-17 17:40:11,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517915241] [2022-10-17 17:40:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 17:40:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 17:40:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:40:11,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 17:40:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 17:40:11,853 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-10-17 17:40:11,854 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 17:40:11,855 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 17:40:11,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 17:40:11,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 17:40:11,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 17:40:11,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 17:40:11,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 17:40:11,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 17:40:11,860 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 17:40:11,867 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 17:40:11,867 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 17:40:11,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 05:40:11 BasicIcfg [2022-10-17 17:40:11,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 17:40:11,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 17:40:11,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 17:40:11,997 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 17:40:11,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 05:40:00" (3/4) ... [2022-10-17 17:40:11,999 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 17:40:12,113 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/witness.graphml [2022-10-17 17:40:12,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 17:40:12,114 INFO L158 Benchmark]: Toolchain (without parser) took 14413.02ms. Allocated memory was 107.0MB in the beginning and 239.1MB in the end (delta: 132.1MB). Free memory was 81.2MB in the beginning and 194.8MB in the end (delta: -113.6MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. [2022-10-17 17:40:12,114 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 75.8MB in the end (delta: 58.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 17:40:12,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 853.01ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 67.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-10-17 17:40:12,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.04ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 64.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:40:12,115 INFO L158 Benchmark]: Boogie Preprocessor took 41.61ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 62.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 17:40:12,115 INFO L158 Benchmark]: RCFGBuilder took 1444.52ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 62.3MB in the beginning and 102.5MB in the end (delta: -40.3MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2022-10-17 17:40:12,116 INFO L158 Benchmark]: TraceAbstraction took 11878.12ms. Allocated memory was 134.2MB in the beginning and 239.1MB in the end (delta: 104.9MB). Free memory was 102.5MB in the beginning and 71.6MB in the end (delta: 31.0MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. [2022-10-17 17:40:12,116 INFO L158 Benchmark]: Witness Printer took 123.67ms. Allocated memory is still 239.1MB. Free memory was 71.6MB in the beginning and 194.8MB in the end (delta: -123.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-10-17 17:40:12,118 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.32ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 75.8MB in the end (delta: 58.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 853.01ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 67.2MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.04ms. Allocated memory is still 107.0MB. Free memory was 67.2MB in the beginning and 64.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.61ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 62.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1444.52ms. Allocated memory was 107.0MB in the beginning and 134.2MB in the end (delta: 27.3MB). Free memory was 62.3MB in the beginning and 102.5MB in the end (delta: -40.3MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11878.12ms. Allocated memory was 134.2MB in the beginning and 239.1MB in the end (delta: 104.9MB). Free memory was 102.5MB in the beginning and 71.6MB in the end (delta: 31.0MB). Peak memory consumption was 134.8MB. Max. memory is 16.1GB. * Witness Printer took 123.67ms. Allocated memory is still 239.1MB. Free memory was 71.6MB in the beginning and 194.8MB in the end (delta: -123.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 129 PlacesBefore, 37 PlacesAfterwards, 121 TransitionsBefore, 28 TransitionsAfterwards, 2240 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 5515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2544, positive: 2372, positive conditional: 0, positive unconditional: 2372, negative: 172, negative conditional: 0, negative unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1476, positive: 1423, positive conditional: 0, positive unconditional: 1423, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1476, positive: 1407, positive conditional: 0, positive unconditional: 1407, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 538, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 503, negative conditional: 0, negative unconditional: 503, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2544, positive: 949, positive conditional: 0, positive unconditional: 949, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 1476, unknown conditional: 0, unknown unconditional: 1476] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 104, Positive conditional cache size: 0, Positive unconditional cache size: 104, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t876; [L844] FCALL, FORK 0 pthread_create(&t876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t876, ((void *)0), P0, ((void *)0))=-3, t876={5: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L845] 0 pthread_t t877; [L846] FCALL, FORK 0 pthread_create(&t877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t877, ((void *)0), P1, ((void *)0))=-2, t876={5:0}, t877={6: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L847] 0 pthread_t t878; [L848] FCALL, FORK 0 pthread_create(&t878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t878, ((void *)0), P2, ((void *)0))=-1, t876={5:0}, t877={6:0}, t878={3: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 [L812] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 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) [L821] 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) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 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 [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 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 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] 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) [L854] 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) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 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 [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 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 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, 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: 846]: 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: 848]: 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: 844]: 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 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 465 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 757 IncrementalHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 71 mSDtfsCounter, 757 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=790occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 316 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 845 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! [2022-10-17 17:40:12,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be8f396a-49c9-4b37-ac95-d16b921cb97f/bin/utaipan-G1rejxKTta/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