./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --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 a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:14:43,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:14:43,392 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-19 05:14:43,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:14:43,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:14:43,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:14:43,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:14:43,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:14:43,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:14:43,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:14:43,461 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:14:43,462 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:14:43,463 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:14:43,465 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:14:43,465 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:14:43,466 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:14:43,466 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:14:43,467 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:14:43,467 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:14:43,468 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:14:43,468 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:14:43,469 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:14:43,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:14:43,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 05:14:43,471 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 05:14:43,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:14:43,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 05:14:43,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:14:43,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 05:14:43,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:14:43,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 05:14:43,475 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 05:14:43,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 05:14:43,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:14:43,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:14:43,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:14:43,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:14:43,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:14:43,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:14:43,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 05:14:43,478 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:14:43,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:14:43,478 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 05:14:43,479 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:14:43,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:14:43,480 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/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_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> a86612b573a63cde2c4106f45bf8b3ea66989a894eb80420a80ff8b17f8f03d1 [2023-11-19 05:14:43,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:14:43,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:14:43,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:14:43,828 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:14:43,829 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:14:43,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2023-11-19 05:14:46,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:14:47,256 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:14:47,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i [2023-11-19 05:14:47,290 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/data/54933a24a/c8340efeb8b64110beb70a8004639649/FLAGa005715a8 [2023-11-19 05:14:47,313 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/data/54933a24a/c8340efeb8b64110beb70a8004639649 [2023-11-19 05:14:47,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:14:47,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:14:47,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:14:47,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:14:47,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:14:47,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:47" (1/1) ... [2023-11-19 05:14:47,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61dee320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:47, skipping insertion in model container [2023-11-19 05:14:47,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:47" (1/1) ... [2023-11-19 05:14:47,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:14:47,584 WARN L240 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_59d5f921-cd33-4bf3-9340-efe0ed157d62/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-19 05:14:47,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:14:47,891 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:14:47,904 WARN L240 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_59d5f921-cd33-4bf3-9340-efe0ed157d62/sv-benchmarks/c/pthread-wmm/mix028_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-19 05:14:47,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:14:48,036 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:14:48,037 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 05:14:48,045 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:14:48,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48 WrapperNode [2023-11-19 05:14:48,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:14:48,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:14:48,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:14:48,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:14:48,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,125 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-19 05:14:48,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:14:48,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:14:48,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:14:48,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:14:48,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,169 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:14:48,180 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:14:48,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:14:48,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:14:48,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (1/1) ... [2023-11-19 05:14:48,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:14:48,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:14:48,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:14:48,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:14:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:14:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 05:14:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 05:14:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 05:14:48,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:14:48,281 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 05:14:48,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 05:14:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 05:14:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 05:14:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 05:14:48,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 05:14:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 05:14:48,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 05:14:48,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:14:48,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:14:48,285 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 05:14:48,467 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:14:48,470 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:14:48,841 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:14:48,993 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:14:48,994 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:14:48,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:48 BoogieIcfgContainer [2023-11-19 05:14:48,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:14:49,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:14:49,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:14:49,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:14:49,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:14:47" (1/3) ... [2023-11-19 05:14:49,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ab2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:49, skipping insertion in model container [2023-11-19 05:14:49,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:48" (2/3) ... [2023-11-19 05:14:49,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ab2c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:49, skipping insertion in model container [2023-11-19 05:14:49,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:48" (3/3) ... [2023-11-19 05:14:49,009 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.opt_pso.opt_rmo.opt.i [2023-11-19 05:14:49,019 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 05:14:49,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:14:49,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 05:14:49,032 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 05:14:49,182 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 05:14:49,227 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 05:14:49,260 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 113 transitions, 238 flow [2023-11-19 05:14:49,263 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 113 transitions, 238 flow [2023-11-19 05:14:49,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 238 flow [2023-11-19 05:14:49,324 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2023-11-19 05:14:49,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 05:14:49,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 3/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-19 05:14:49,339 INFO L119 LiptonReduction]: Number of co-enabled transitions 2288 [2023-11-19 05:14:55,660 INFO L134 LiptonReduction]: Checked pairs total: 6091 [2023-11-19 05:14:55,660 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-11-19 05:14:55,669 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 68 flow [2023-11-19 05:14:55,789 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 852 states, 849 states have (on average 3.371024734982332) internal successors, (2862), 851 states have internal predecessors, (2862), 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) [2023-11-19 05:14:55,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:14:55,816 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=LoopHeads, 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;@68acabce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:14:55,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 05:14:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 852 states, 849 states have (on average 3.371024734982332) internal successors, (2862), 851 states have internal predecessors, (2862), 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) [2023-11-19 05:14:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:14:55,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:14:55,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:14:55,829 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:14:55,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:14:55,834 INFO L85 PathProgramCache]: Analyzing trace with hash 472127001, now seen corresponding path program 1 times [2023-11-19 05:14:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:14:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926277732] [2023-11-19 05:14:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:14:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:14:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:14:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:14:56,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:14:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926277732] [2023-11-19 05:14:56,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926277732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:14:56,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:14:56,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:14:56,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687094534] [2023-11-19 05:14:56,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:14:56,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:14:56,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:14:56,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:14:56,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:14:56,422 INFO L87 Difference]: Start difference. First operand has 852 states, 849 states have (on average 3.371024734982332) internal successors, (2862), 851 states have internal predecessors, (2862), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-11-19 05:14:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:14:56,575 INFO L93 Difference]: Finished difference Result 692 states and 2139 transitions. [2023-11-19 05:14:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:14:56,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-11-19 05:14:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:14:56,614 INFO L225 Difference]: With dead ends: 692 [2023-11-19 05:14:56,614 INFO L226 Difference]: Without dead ends: 662 [2023-11-19 05:14:56,615 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 [2023-11-19 05:14:56,620 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:14:56,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 8 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:14:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2023-11-19 05:14:56,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2023-11-19 05:14:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 3.1164901664145233) internal successors, (2060), 661 states have internal predecessors, (2060), 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) [2023-11-19 05:14:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2023-11-19 05:14:56,721 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2023-11-19 05:14:56,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:14:56,721 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2023-11-19 05:14:56,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-11-19 05:14:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2023-11-19 05:14:56,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 05:14:56,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:14:56,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:14:56,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:14:56,724 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:14:56,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:14:56,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1499554186, now seen corresponding path program 1 times [2023-11-19 05:14:56,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:14:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093428937] [2023-11-19 05:14:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:14:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:14:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:14:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:14:57,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:14:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093428937] [2023-11-19 05:14:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093428937] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:14:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:14:57,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:14:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011833073] [2023-11-19 05:14:57,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:14:57,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:14:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:14:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:14:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:14:57,456 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:14:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:14:57,608 INFO L93 Difference]: Finished difference Result 692 states and 2124 transitions. [2023-11-19 05:14:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:14:57,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 05:14:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:14:57,619 INFO L225 Difference]: With dead ends: 692 [2023-11-19 05:14:57,620 INFO L226 Difference]: Without dead ends: 692 [2023-11-19 05:14:57,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:14:57,623 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:14:57,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 7 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:14:57,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2023-11-19 05:14:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 632. [2023-11-19 05:14:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 3.0602218700475436) internal successors, (1931), 631 states have internal predecessors, (1931), 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) [2023-11-19 05:14:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1931 transitions. [2023-11-19 05:14:57,680 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1931 transitions. Word has length 9 [2023-11-19 05:14:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:14:57,682 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 1931 transitions. [2023-11-19 05:14:57,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:14:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1931 transitions. [2023-11-19 05:14:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:14:57,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:14:57,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:14:57,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:14:57,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:14:57,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:14:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2036379426, now seen corresponding path program 1 times [2023-11-19 05:14:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:14:57,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022680235] [2023-11-19 05:14:57,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:14:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:14:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:14:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:14:58,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:14:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022680235] [2023-11-19 05:14:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022680235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:14:58,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:14:58,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:14:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912211206] [2023-11-19 05:14:58,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:14:58,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:14:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:14:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:14:58,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:14:58,526 INFO L87 Difference]: Start difference. First operand 632 states and 1931 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-19 05:14:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:14:58,706 INFO L93 Difference]: Finished difference Result 728 states and 2239 transitions. [2023-11-19 05:14:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:14:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2023-11-19 05:14:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:14:58,714 INFO L225 Difference]: With dead ends: 728 [2023-11-19 05:14:58,715 INFO L226 Difference]: Without dead ends: 728 [2023-11-19 05:14:58,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:14:58,720 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:14:58,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 8 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:14:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2023-11-19 05:14:58,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 628. [2023-11-19 05:14:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 3.0494417862838916) internal successors, (1912), 627 states have internal predecessors, (1912), 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) [2023-11-19 05:14:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1912 transitions. [2023-11-19 05:14:58,754 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1912 transitions. Word has length 11 [2023-11-19 05:14:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:14:58,754 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 1912 transitions. [2023-11-19 05:14:58,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2023-11-19 05:14:58,754 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1912 transitions. [2023-11-19 05:14:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:14:58,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:14:58,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:14:58,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:14:58,758 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:14:58,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:14:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash -926716948, now seen corresponding path program 1 times [2023-11-19 05:14:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:14:58,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952862801] [2023-11-19 05:14:58,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:14:58,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:14:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:14:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:14:59,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:14:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952862801] [2023-11-19 05:14:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952862801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:14:59,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:14:59,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:14:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550555390] [2023-11-19 05:14:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:14:59,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:14:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:14:59,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:14:59,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:14:59,365 INFO L87 Difference]: Start difference. First operand 628 states and 1912 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-11-19 05:14:59,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:14:59,495 INFO L93 Difference]: Finished difference Result 648 states and 1966 transitions. [2023-11-19 05:14:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:14:59,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2023-11-19 05:14:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:14:59,502 INFO L225 Difference]: With dead ends: 648 [2023-11-19 05:14:59,503 INFO L226 Difference]: Without dead ends: 648 [2023-11-19 05:14:59,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:14:59,504 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 18 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:14:59,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 13 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:14:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-11-19 05:14:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 644. [2023-11-19 05:14:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 3.04199066874028) internal successors, (1956), 643 states have internal predecessors, (1956), 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) [2023-11-19 05:14:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1956 transitions. [2023-11-19 05:14:59,534 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1956 transitions. Word has length 12 [2023-11-19 05:14:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:14:59,535 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 1956 transitions. [2023-11-19 05:14:59,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-11-19 05:14:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1956 transitions. [2023-11-19 05:14:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:14:59,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:14:59,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:14:59,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:14:59,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:14:59,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:14:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -943645727, now seen corresponding path program 1 times [2023-11-19 05:14:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:14:59,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269758211] [2023-11-19 05:14:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:14:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:14:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:00,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:00,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269758211] [2023-11-19 05:15:00,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269758211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:00,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:15:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092227584] [2023-11-19 05:15:00,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:00,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:15:00,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:00,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:15:00,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:15:00,036 INFO L87 Difference]: Start difference. First operand 644 states and 1956 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2023-11-19 05:15:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:00,180 INFO L93 Difference]: Finished difference Result 640 states and 1941 transitions. [2023-11-19 05:15:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:15:00,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2023-11-19 05:15:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:00,187 INFO L225 Difference]: With dead ends: 640 [2023-11-19 05:15:00,187 INFO L226 Difference]: Without dead ends: 640 [2023-11-19 05:15:00,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:00,188 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:00,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 15 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2023-11-19 05:15:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 628. [2023-11-19 05:15:00,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 3.036682615629984) internal successors, (1904), 627 states have internal predecessors, (1904), 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) [2023-11-19 05:15:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1904 transitions. [2023-11-19 05:15:00,217 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 1904 transitions. Word has length 13 [2023-11-19 05:15:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:00,218 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 1904 transitions. [2023-11-19 05:15:00,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2023-11-19 05:15:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 1904 transitions. [2023-11-19 05:15:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:15:00,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:00,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:00,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:15:00,221 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:00,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1181783821, now seen corresponding path program 1 times [2023-11-19 05:15:00,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:00,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986975310] [2023-11-19 05:15:00,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:00,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:00,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:00,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986975310] [2023-11-19 05:15:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986975310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:00,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:15:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030525463] [2023-11-19 05:15:00,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:00,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:15:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:00,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:15:00,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:15:00,889 INFO L87 Difference]: Start difference. First operand 628 states and 1904 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:01,010 INFO L93 Difference]: Finished difference Result 758 states and 2319 transitions. [2023-11-19 05:15:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:15:01,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 05:15:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:01,018 INFO L225 Difference]: With dead ends: 758 [2023-11-19 05:15:01,019 INFO L226 Difference]: Without dead ends: 758 [2023-11-19 05:15:01,019 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 [2023-11-19 05:15:01,022 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:01,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 15 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2023-11-19 05:15:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 675. [2023-11-19 05:15:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 3.06379821958457) internal successors, (2065), 674 states have internal predecessors, (2065), 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) [2023-11-19 05:15:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 2065 transitions. [2023-11-19 05:15:01,057 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 2065 transitions. Word has length 14 [2023-11-19 05:15:01,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:01,058 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 2065 transitions. [2023-11-19 05:15:01,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 2065 transitions. [2023-11-19 05:15:01,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:15:01,060 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:01,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:01,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:15:01,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:01,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash 811752777, now seen corresponding path program 2 times [2023-11-19 05:15:01,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554594746] [2023-11-19 05:15:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:01,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:02,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:02,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554594746] [2023-11-19 05:15:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554594746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:15:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976976356] [2023-11-19 05:15:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:02,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:15:02,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:02,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:15:02,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:02,043 INFO L87 Difference]: Start difference. First operand 675 states and 2065 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2023-11-19 05:15:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:02,289 INFO L93 Difference]: Finished difference Result 867 states and 2667 transitions. [2023-11-19 05:15:02,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:15:02,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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 [2023-11-19 05:15:02,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:02,299 INFO L225 Difference]: With dead ends: 867 [2023-11-19 05:15:02,299 INFO L226 Difference]: Without dead ends: 867 [2023-11-19 05:15:02,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:15:02,300 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:02,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 16 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:15:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2023-11-19 05:15:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 705. [2023-11-19 05:15:02,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 704 states have (on average 3.0511363636363638) internal successors, (2148), 704 states have internal predecessors, (2148), 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) [2023-11-19 05:15:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 2148 transitions. [2023-11-19 05:15:02,335 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 2148 transitions. Word has length 14 [2023-11-19 05:15:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:02,335 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 2148 transitions. [2023-11-19 05:15:02,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2023-11-19 05:15:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 2148 transitions. [2023-11-19 05:15:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:15:02,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:02,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:02,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 05:15:02,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:02,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:02,339 INFO L85 PathProgramCache]: Analyzing trace with hash 814254477, now seen corresponding path program 3 times [2023-11-19 05:15:02,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48477117] [2023-11-19 05:15:02,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:02,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:02,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:02,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48477117] [2023-11-19 05:15:02,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48477117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:02,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:02,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:15:02,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528594392] [2023-11-19 05:15:02,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:02,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:15:02,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:02,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:15:02,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:02,931 INFO L87 Difference]: Start difference. First operand 705 states and 2148 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2023-11-19 05:15:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:03,132 INFO L93 Difference]: Finished difference Result 809 states and 2444 transitions. [2023-11-19 05:15:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:15:03,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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 [2023-11-19 05:15:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:03,141 INFO L225 Difference]: With dead ends: 809 [2023-11-19 05:15:03,141 INFO L226 Difference]: Without dead ends: 809 [2023-11-19 05:15:03,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:15:03,145 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:03,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 18 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:15:03,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2023-11-19 05:15:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 698. [2023-11-19 05:15:03,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 3.0358680057388807) internal successors, (2116), 697 states have internal predecessors, (2116), 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) [2023-11-19 05:15:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 2116 transitions. [2023-11-19 05:15:03,179 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 2116 transitions. Word has length 14 [2023-11-19 05:15:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:03,179 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 2116 transitions. [2023-11-19 05:15:03,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2023-11-19 05:15:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 2116 transitions. [2023-11-19 05:15:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:15:03,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:03,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:03,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 05:15:03,182 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:03,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:03,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1519333459, now seen corresponding path program 1 times [2023-11-19 05:15:03,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:03,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379345553] [2023-11-19 05:15:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:03,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:03,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:03,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379345553] [2023-11-19 05:15:03,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379345553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:03,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:03,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:15:03,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335248968] [2023-11-19 05:15:03,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:03,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:15:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:15:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:03,926 INFO L87 Difference]: Start difference. First operand 698 states and 2116 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2023-11-19 05:15:04,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:04,037 INFO L93 Difference]: Finished difference Result 690 states and 2088 transitions. [2023-11-19 05:15:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:15:04,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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 [2023-11-19 05:15:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:04,044 INFO L225 Difference]: With dead ends: 690 [2023-11-19 05:15:04,045 INFO L226 Difference]: Without dead ends: 690 [2023-11-19 05:15:04,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:04,047 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:04,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 13 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2023-11-19 05:15:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2023-11-19 05:15:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 3.030478955007257) internal successors, (2088), 689 states have internal predecessors, (2088), 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) [2023-11-19 05:15:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 2088 transitions. [2023-11-19 05:15:04,079 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 2088 transitions. Word has length 14 [2023-11-19 05:15:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:04,083 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 2088 transitions. [2023-11-19 05:15:04,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 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) [2023-11-19 05:15:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 2088 transitions. [2023-11-19 05:15:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:15:04,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:04,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:04,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:15:04,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:04,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1516842485, now seen corresponding path program 1 times [2023-11-19 05:15:04,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:04,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800951921] [2023-11-19 05:15:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:04,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:04,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800951921] [2023-11-19 05:15:04,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800951921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:04,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:04,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 05:15:04,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803540249] [2023-11-19 05:15:04,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:04,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:15:04,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:04,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:15:04,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:15:04,267 INFO L87 Difference]: Start difference. First operand 690 states and 2088 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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) [2023-11-19 05:15:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:04,343 INFO L93 Difference]: Finished difference Result 963 states and 2864 transitions. [2023-11-19 05:15:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:15:04,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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 [2023-11-19 05:15:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:04,350 INFO L225 Difference]: With dead ends: 963 [2023-11-19 05:15:04,350 INFO L226 Difference]: Without dead ends: 664 [2023-11-19 05:15:04,351 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 [2023-11-19 05:15:04,352 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:04,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:04,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2023-11-19 05:15:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 634. [2023-11-19 05:15:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 2.854660347551343) internal successors, (1807), 633 states have internal predecessors, (1807), 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) [2023-11-19 05:15:04,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1807 transitions. [2023-11-19 05:15:04,380 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1807 transitions. Word has length 14 [2023-11-19 05:15:04,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:04,381 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 1807 transitions. [2023-11-19 05:15:04,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 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) [2023-11-19 05:15:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1807 transitions. [2023-11-19 05:15:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:15:04,383 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:04,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:15:04,384 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:04,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash -579521525, now seen corresponding path program 2 times [2023-11-19 05:15:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453148134] [2023-11-19 05:15:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:04,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:04,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453148134] [2023-11-19 05:15:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453148134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:04,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:04,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:15:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623820827] [2023-11-19 05:15:04,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:04,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:15:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:15:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:15:04,568 INFO L87 Difference]: Start difference. First operand 634 states and 1807 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2023-11-19 05:15:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:04,677 INFO L93 Difference]: Finished difference Result 602 states and 1516 transitions. [2023-11-19 05:15:04,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:15:04,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 [2023-11-19 05:15:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:04,682 INFO L225 Difference]: With dead ends: 602 [2023-11-19 05:15:04,682 INFO L226 Difference]: Without dead ends: 434 [2023-11-19 05:15:04,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:15:04,683 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:04,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 20 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:04,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-19 05:15:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2023-11-19 05:15:04,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.4364896073903) internal successors, (1055), 433 states have internal predecessors, (1055), 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) [2023-11-19 05:15:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1055 transitions. [2023-11-19 05:15:04,700 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1055 transitions. Word has length 14 [2023-11-19 05:15:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:04,701 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 1055 transitions. [2023-11-19 05:15:04,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2023-11-19 05:15:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1055 transitions. [2023-11-19 05:15:04,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:15:04,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:04,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:04,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:15:04,703 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:04,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash 582935751, now seen corresponding path program 1 times [2023-11-19 05:15:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667908614] [2023-11-19 05:15:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:04,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:04,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:04,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:04,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667908614] [2023-11-19 05:15:04,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667908614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:04,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:04,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:15:04,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130134399] [2023-11-19 05:15:04,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:04,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:15:04,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:15:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:15:04,865 INFO L87 Difference]: Start difference. First operand 434 states and 1055 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:04,999 INFO L93 Difference]: Finished difference Result 353 states and 800 transitions. [2023-11-19 05:15:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:15:04,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 05:15:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:05,002 INFO L225 Difference]: With dead ends: 353 [2023-11-19 05:15:05,002 INFO L226 Difference]: Without dead ends: 275 [2023-11-19 05:15:05,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:05,003 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:05,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 27 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-19 05:15:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 245. [2023-11-19 05:15:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.2418032786885247) internal successors, (547), 244 states have internal predecessors, (547), 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) [2023-11-19 05:15:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 547 transitions. [2023-11-19 05:15:05,014 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 547 transitions. Word has length 15 [2023-11-19 05:15:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:05,014 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 547 transitions. [2023-11-19 05:15:05,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:15:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 547 transitions. [2023-11-19 05:15:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 05:15:05,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:05,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:05,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:15:05,016 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:05,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1022512719, now seen corresponding path program 1 times [2023-11-19 05:15:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947795981] [2023-11-19 05:15:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:05,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947795981] [2023-11-19 05:15:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947795981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 05:15:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798293542] [2023-11-19 05:15:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:05,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:15:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:05,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:15:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:15:05,223 INFO L87 Difference]: Start difference. First operand 245 states and 547 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-19 05:15:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:05,351 INFO L93 Difference]: Finished difference Result 224 states and 504 transitions. [2023-11-19 05:15:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:15:05,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-11-19 05:15:05,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:05,353 INFO L225 Difference]: With dead ends: 224 [2023-11-19 05:15:05,353 INFO L226 Difference]: Without dead ends: 165 [2023-11-19 05:15:05,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:15:05,354 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:05,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 24 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:15:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-19 05:15:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2023-11-19 05:15:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 2.3048780487804876) internal successors, (378), 164 states have internal predecessors, (378), 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) [2023-11-19 05:15:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 378 transitions. [2023-11-19 05:15:05,362 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 378 transitions. Word has length 18 [2023-11-19 05:15:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:05,362 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 378 transitions. [2023-11-19 05:15:05,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-19 05:15:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 378 transitions. [2023-11-19 05:15:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:15:05,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:05,364 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] [2023-11-19 05:15:05,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 05:15:05,364 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:05,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1500540290, now seen corresponding path program 1 times [2023-11-19 05:15:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:05,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820835046] [2023-11-19 05:15:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:15:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:15:05,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:15:05,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820835046] [2023-11-19 05:15:05,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820835046] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:15:05,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:15:05,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:15:05,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970918580] [2023-11-19 05:15:05,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:15:05,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:15:05,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:15:05,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:15:05,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:15:05,815 INFO L87 Difference]: Start difference. First operand 165 states and 378 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) [2023-11-19 05:15:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:15:06,063 INFO L93 Difference]: Finished difference Result 209 states and 470 transitions. [2023-11-19 05:15:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:15:06,064 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 [2023-11-19 05:15:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:15:06,065 INFO L225 Difference]: With dead ends: 209 [2023-11-19 05:15:06,065 INFO L226 Difference]: Without dead ends: 73 [2023-11-19 05:15:06,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:15:06,066 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:15:06,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 14 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:15:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-19 05:15:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-11-19 05:15:06,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.9166666666666667) internal successors, (138), 72 states have internal predecessors, (138), 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) [2023-11-19 05:15:06,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 138 transitions. [2023-11-19 05:15:06,069 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 138 transitions. Word has length 22 [2023-11-19 05:15:06,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:15:06,070 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 138 transitions. [2023-11-19 05:15:06,070 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) [2023-11-19 05:15:06,070 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 138 transitions. [2023-11-19 05:15:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 05:15:06,071 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:15:06,071 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] [2023-11-19 05:15:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 05:15:06,071 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 05:15:06,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:15:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash -995879550, now seen corresponding path program 2 times [2023-11-19 05:15:06,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:15:06,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67911146] [2023-11-19 05:15:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:15:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:15:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:15:06,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 05:15:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 05:15:06,237 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 05:15:06,237 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 05:15:06,238 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 05:15:06,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 05:15:06,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 05:15:06,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 05:15:06,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 05:15:06,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 05:15:06,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 05:15:06,245 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:15:06,251 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 05:15:06,252 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:15:06,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 05:15:06,324 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 05:15:06,328 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 05:15:06,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:15:06 BasicIcfg [2023-11-19 05:15:06,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:15:06,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:15:06,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:15:06,365 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:15:06,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:48" (3/4) ... [2023-11-19 05:15:06,367 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 05:15:06,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 05:15:06,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 05:15:06,405 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 05:15:06,493 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 05:15:06,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:15:06,494 INFO L158 Benchmark]: Toolchain (without parser) took 19172.00ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 137.4MB in the beginning and 121.2MB in the end (delta: 16.1MB). Peak memory consumption was 155.2MB. Max. memory is 16.1GB. [2023-11-19 05:15:06,495 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 146.8MB. Free memory was 88.5MB in the beginning and 88.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:15:06,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.95ms. Allocated memory is still 186.6MB. Free memory was 137.4MB in the beginning and 113.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 05:15:06,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.59ms. Allocated memory is still 186.6MB. Free memory was 113.5MB in the beginning and 110.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:15:06,497 INFO L158 Benchmark]: Boogie Preprocessor took 53.14ms. Allocated memory is still 186.6MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:15:06,497 INFO L158 Benchmark]: RCFGBuilder took 818.06ms. Allocated memory is still 186.6MB. Free memory was 108.8MB in the beginning and 71.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-19 05:15:06,497 INFO L158 Benchmark]: TraceAbstraction took 17362.73ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 70.3MB in the beginning and 131.7MB in the end (delta: -61.5MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2023-11-19 05:15:06,498 INFO L158 Benchmark]: Witness Printer took 128.93ms. Allocated memory is still 325.1MB. Free memory was 130.7MB in the beginning and 121.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 05:15:06,504 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 146.8MB. Free memory was 88.5MB in the beginning and 88.3MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.95ms. Allocated memory is still 186.6MB. Free memory was 137.4MB in the beginning and 113.5MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.59ms. Allocated memory is still 186.6MB. Free memory was 113.5MB in the beginning and 110.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.14ms. Allocated memory is still 186.6MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 818.06ms. Allocated memory is still 186.6MB. Free memory was 108.8MB in the beginning and 71.0MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17362.73ms. Allocated memory was 186.6MB in the beginning and 325.1MB in the end (delta: 138.4MB). Free memory was 70.3MB in the beginning and 131.7MB in the end (delta: -61.5MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * Witness Printer took 128.93ms. Allocated memory is still 325.1MB. Free memory was 130.7MB in the beginning and 121.2MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 120 PlacesBefore, 37 PlacesAfterwards, 113 TransitionsBefore, 28 TransitionsAfterwards, 2288 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 6091 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2923, independent: 2743, independent conditional: 0, independent unconditional: 2743, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1557, independent: 1494, independent conditional: 0, independent unconditional: 1494, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1557, independent: 1481, independent conditional: 0, independent unconditional: 1481, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 727, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 696, dependent conditional: 0, dependent unconditional: 696, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2923, independent: 1249, independent conditional: 0, independent unconditional: 1249, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1557, unknown conditional: 0, unknown unconditional: 1557] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t748={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t748={5:0}, t749={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L801] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L832] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L832] RET 0 assume_abort_if_not(main$tmp_guard0) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t748={5:0}, t749={6:0}, t750={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L846] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L847] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L848] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L849] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L851] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 386 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 386 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 122 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1020 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 84 mSDtfsCounter, 1020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852occurred in iteration=0, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 592 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 211 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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! [2023-11-19 05:15:06,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_59d5f921-cd33-4bf3-9340-efe0ed157d62/bin/utaipan-verify-t7M7D8N6sZ/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