./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:17:13,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:17:13,301 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 07:17:13,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:17:13,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:17:13,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:17:13,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:17:13,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:17:13,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:17:13,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:17:13,355 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:17:13,355 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:17:13,355 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:17:13,356 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:17:13,358 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:17:13,358 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:17:13,359 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:17:13,359 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:17:13,359 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:17:13,360 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:17:13,360 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:17:13,360 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:17:13,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:17:13,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:17:13,362 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:17:13,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:17:13,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:17:13,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:17:13,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:17:13,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:17:13,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:17:13,368 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:17:13,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:17:13,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:17:13,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:17:13,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:17:13,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:17:13,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:17:13,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:17:13,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:17:13,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:17:13,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:17:13,371 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:17:13,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:17:13,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:17:13,371 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:17:13,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:17:13,372 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_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/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_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2024-11-09 07:17:13,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:17:13,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:17:13,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:17:13,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:17:13,697 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:17:13,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i Unable to find full path for "g++" [2024-11-09 07:17:15,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:17:16,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:17:16,034 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2024-11-09 07:17:16,065 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/data/c5ea2a0c9/cb4e694042604741add11e1e3dc3f7ae/FLAG7f86d0756 [2024-11-09 07:17:16,295 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/data/c5ea2a0c9/cb4e694042604741add11e1e3dc3f7ae [2024-11-09 07:17:16,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:17:16,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:17:16,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:17:16,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:17:16,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:17:16,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:17:16" (1/1) ... [2024-11-09 07:17:16,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f078a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:16, skipping insertion in model container [2024-11-09 07:17:16,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:17:16" (1/1) ... [2024-11-09 07:17:16,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:17:16,593 WARN L250 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_e9488866-87b1-46dd-8f98-ebbfea8cdf66/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2024-11-09 07:17:16,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:17:16,943 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:17:16,961 WARN L250 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_e9488866-87b1-46dd-8f98-ebbfea8cdf66/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2024-11-09 07:17:17,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:17:17,095 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:17:17,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17 WrapperNode [2024-11-09 07:17:17,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:17:17,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:17:17,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:17:17,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:17:17,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,177 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-11-09 07:17:17,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:17:17,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:17:17,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:17:17,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:17:17,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:17:17,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:17:17,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:17:17,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:17:17,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (1/1) ... [2024-11-09 07:17:17,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:17:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:17:17,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:17:17,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:17:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:17:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:17:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-09 07:17:17,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-09 07:17:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-09 07:17:17,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-09 07:17:17,317 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-09 07:17:17,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-09 07:17:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:17:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:17:17,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:17:17,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:17:17,320 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:17:17,478 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:17:17,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:17:17,828 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:17:17,828 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:17:18,110 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:17:18,111 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:17:18,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:17:18 BoogieIcfgContainer [2024-11-09 07:17:18,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:17:18,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:17:18,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:17:18,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:17:18,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:17:16" (1/3) ... [2024-11-09 07:17:18,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f92927d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:17:18, skipping insertion in model container [2024-11-09 07:17:18,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:17:17" (2/3) ... [2024-11-09 07:17:18,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f92927d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:17:18, skipping insertion in model container [2024-11-09 07:17:18,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:17:18" (3/3) ... [2024-11-09 07:17:18,121 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2024-11-09 07:17:18,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:17:18,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:17:18,147 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:17:18,224 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 07:17:18,262 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 39 transitions, 90 flow [2024-11-09 07:17:18,578 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3936 states, 3933 states have (on average 3.484871599288075) internal successors, (13706), 3935 states have internal predecessors, (13706), 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) [2024-11-09 07:17:18,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:17:18,620 INFO L333 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, 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;@254c704f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:17:18,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-09 07:17:18,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 3936 states, 3933 states have (on average 3.484871599288075) internal successors, (13706), 3935 states have internal predecessors, (13706), 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) [2024-11-09 07:17:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:17:18,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:18,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:18,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:18,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1803674900, now seen corresponding path program 1 times [2024-11-09 07:17:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494056407] [2024-11-09 07:17:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:18,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:19,346 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494056407] [2024-11-09 07:17:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494056407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:19,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:17:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141419496] [2024-11-09 07:17:19,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:17:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:19,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:17:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:17:19,399 INFO L87 Difference]: Start difference. First operand has 3936 states, 3933 states have (on average 3.484871599288075) internal successors, (13706), 3935 states have internal predecessors, (13706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-11-09 07:17:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:19,650 INFO L93 Difference]: Finished difference Result 4132 states and 14336 transitions. [2024-11-09 07:17:19,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:17:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-11-09 07:17:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:19,699 INFO L225 Difference]: With dead ends: 4132 [2024-11-09 07:17:19,700 INFO L226 Difference]: Without dead ends: 3201 [2024-11-09 07:17:19,710 INFO L431 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 [2024-11-09 07:17:19,716 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:19,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:17:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2024-11-09 07:17:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 3201. [2024-11-09 07:17:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3201 states, 3200 states have (on average 3.43) internal successors, (10976), 3200 states have internal predecessors, (10976), 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) [2024-11-09 07:17:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3201 states to 3201 states and 10976 transitions. [2024-11-09 07:17:19,995 INFO L78 Accepts]: Start accepts. Automaton has 3201 states and 10976 transitions. Word has length 8 [2024-11-09 07:17:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:19,996 INFO L471 AbstractCegarLoop]: Abstraction has 3201 states and 10976 transitions. [2024-11-09 07:17:19,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) [2024-11-09 07:17:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3201 states and 10976 transitions. [2024-11-09 07:17:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:17:20,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:20,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:20,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:17:20,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:20,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1194542543, now seen corresponding path program 1 times [2024-11-09 07:17:20,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:20,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181993393] [2024-11-09 07:17:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:20,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:20,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:20,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181993393] [2024-11-09 07:17:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181993393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:20,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:20,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:17:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359471273] [2024-11-09 07:17:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:20,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:17:20,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:20,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:17:20,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:17:20,543 INFO L87 Difference]: Start difference. First operand 3201 states and 10976 transitions. Second operand has 5 states, 5 states have (on average 2.8) 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) [2024-11-09 07:17:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:20,869 INFO L93 Difference]: Finished difference Result 4405 states and 14927 transitions. [2024-11-09 07:17:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:17:20,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) 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 [2024-11-09 07:17:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:20,896 INFO L225 Difference]: With dead ends: 4405 [2024-11-09 07:17:20,896 INFO L226 Difference]: Without dead ends: 3033 [2024-11-09 07:17:20,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:17:20,902 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 71 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:20,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 113 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:17:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3033 states. [2024-11-09 07:17:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3033 to 3033. [2024-11-09 07:17:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 3032 states have (on average 3.4063324538258577) internal successors, (10328), 3032 states have internal predecessors, (10328), 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) [2024-11-09 07:17:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 10328 transitions. [2024-11-09 07:17:21,122 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 10328 transitions. Word has length 14 [2024-11-09 07:17:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:21,122 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 10328 transitions. [2024-11-09 07:17:21,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) 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) [2024-11-09 07:17:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 10328 transitions. [2024-11-09 07:17:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:17:21,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:21,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:21,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:17:21,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:21,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1069134706, now seen corresponding path program 1 times [2024-11-09 07:17:21,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:21,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586453393] [2024-11-09 07:17:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:22,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586453393] [2024-11-09 07:17:22,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586453393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:22,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:22,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:17:22,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730004190] [2024-11-09 07:17:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:22,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:17:22,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:22,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:17:22,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:17:22,353 INFO L87 Difference]: Start difference. First operand 3033 states and 10328 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:17:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:23,016 INFO L93 Difference]: Finished difference Result 6108 states and 20536 transitions. [2024-11-09 07:17:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:17:23,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:17:23,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:23,049 INFO L225 Difference]: With dead ends: 6108 [2024-11-09 07:17:23,050 INFO L226 Difference]: Without dead ends: 4502 [2024-11-09 07:17:23,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:17:23,055 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 119 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:23,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 154 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:17:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4502 states. [2024-11-09 07:17:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4502 to 3088. [2024-11-09 07:17:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3088 states, 3087 states have (on average 3.3407839326206674) internal successors, (10313), 3087 states have internal predecessors, (10313), 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) [2024-11-09 07:17:23,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 10313 transitions. [2024-11-09 07:17:23,185 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 10313 transitions. Word has length 16 [2024-11-09 07:17:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:23,186 INFO L471 AbstractCegarLoop]: Abstraction has 3088 states and 10313 transitions. [2024-11-09 07:17:23,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:17:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 10313 transitions. [2024-11-09 07:17:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:17:23,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:23,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:23,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:17:23,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:23,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:23,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1715493120, now seen corresponding path program 1 times [2024-11-09 07:17:23,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:23,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965856102] [2024-11-09 07:17:23,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:23,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965856102] [2024-11-09 07:17:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965856102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:23,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:17:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712466186] [2024-11-09 07:17:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:23,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:17:23,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:23,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:17:23,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:17:23,987 INFO L87 Difference]: Start difference. First operand 3088 states and 10313 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:17:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:24,649 INFO L93 Difference]: Finished difference Result 5542 states and 18380 transitions. [2024-11-09 07:17:24,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:17:24,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:17:24,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:24,684 INFO L225 Difference]: With dead ends: 5542 [2024-11-09 07:17:24,684 INFO L226 Difference]: Without dead ends: 3594 [2024-11-09 07:17:24,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:17:24,690 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 117 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:24,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 144 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:17:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2024-11-09 07:17:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 2724. [2024-11-09 07:17:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2723 states have (on average 3.2930591259640103) internal successors, (8967), 2723 states have internal predecessors, (8967), 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) [2024-11-09 07:17:24,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 8967 transitions. [2024-11-09 07:17:24,844 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 8967 transitions. Word has length 17 [2024-11-09 07:17:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:24,844 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 8967 transitions. [2024-11-09 07:17:24,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:17:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 8967 transitions. [2024-11-09 07:17:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:17:24,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:24,851 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:24,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:17:24,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:24,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash 331829171, now seen corresponding path program 1 times [2024-11-09 07:17:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:24,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842576543] [2024-11-09 07:17:24,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:25,501 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:25,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842576543] [2024-11-09 07:17:25,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842576543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:25,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:25,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:17:25,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173274899] [2024-11-09 07:17:25,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:25,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:17:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:25,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:17:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:17:25,504 INFO L87 Difference]: Start difference. First operand 2724 states and 8967 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) [2024-11-09 07:17:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:25,803 INFO L93 Difference]: Finished difference Result 3224 states and 10542 transitions. [2024-11-09 07:17:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:17:25,804 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 [2024-11-09 07:17:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:25,821 INFO L225 Difference]: With dead ends: 3224 [2024-11-09 07:17:25,821 INFO L226 Difference]: Without dead ends: 2524 [2024-11-09 07:17:25,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:17:25,825 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 54 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:25,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 118 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:17:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2024-11-09 07:17:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2524. [2024-11-09 07:17:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2524 states, 2523 states have (on average 3.2687277051129606) internal successors, (8247), 2523 states have internal predecessors, (8247), 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) [2024-11-09 07:17:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 8247 transitions. [2024-11-09 07:17:25,917 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 8247 transitions. Word has length 18 [2024-11-09 07:17:25,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:25,918 INFO L471 AbstractCegarLoop]: Abstraction has 2524 states and 8247 transitions. [2024-11-09 07:17:25,919 INFO L472 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) [2024-11-09 07:17:25,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 8247 transitions. [2024-11-09 07:17:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:17:25,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:25,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:25,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:17:25,926 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 163255169, now seen corresponding path program 1 times [2024-11-09 07:17:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841929997] [2024-11-09 07:17:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:26,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841929997] [2024-11-09 07:17:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841929997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:17:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20434385] [2024-11-09 07:17:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:26,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:17:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:17:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:17:26,182 INFO L87 Difference]: Start difference. First operand 2524 states and 8247 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:17:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:26,436 INFO L93 Difference]: Finished difference Result 4224 states and 13642 transitions. [2024-11-09 07:17:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:17:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 07:17:26,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:26,455 INFO L225 Difference]: With dead ends: 4224 [2024-11-09 07:17:26,456 INFO L226 Difference]: Without dead ends: 2739 [2024-11-09 07:17:26,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:17:26,461 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:26,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 128 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:17:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2024-11-09 07:17:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2329. [2024-11-09 07:17:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 2328 states have (on average 3.185567010309278) internal successors, (7416), 2328 states have internal predecessors, (7416), 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) [2024-11-09 07:17:26,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 7416 transitions. [2024-11-09 07:17:26,571 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 7416 transitions. Word has length 19 [2024-11-09 07:17:26,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:26,572 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 7416 transitions. [2024-11-09 07:17:26,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:17:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 7416 transitions. [2024-11-09 07:17:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:17:26,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:26,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:26,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:17:26,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:26,579 INFO L85 PathProgramCache]: Analyzing trace with hash 157806373, now seen corresponding path program 1 times [2024-11-09 07:17:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070123642] [2024-11-09 07:17:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:27,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:27,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070123642] [2024-11-09 07:17:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070123642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:27,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:17:27,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028731791] [2024-11-09 07:17:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:27,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:17:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:17:27,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:17:27,422 INFO L87 Difference]: Start difference. First operand 2329 states and 7416 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-09 07:17:27,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:27,799 INFO L93 Difference]: Finished difference Result 2749 states and 8707 transitions. [2024-11-09 07:17:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:17:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2024-11-09 07:17:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:27,816 INFO L225 Difference]: With dead ends: 2749 [2024-11-09 07:17:27,816 INFO L226 Difference]: Without dead ends: 2249 [2024-11-09 07:17:27,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:17:27,821 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:27,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 170 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:17:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2024-11-09 07:17:27,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2249. [2024-11-09 07:17:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2249 states, 2248 states have (on average 3.1637010676156585) internal successors, (7112), 2248 states have internal predecessors, (7112), 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) [2024-11-09 07:17:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 7112 transitions. [2024-11-09 07:17:27,893 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 7112 transitions. Word has length 20 [2024-11-09 07:17:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:27,894 INFO L471 AbstractCegarLoop]: Abstraction has 2249 states and 7112 transitions. [2024-11-09 07:17:27,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-09 07:17:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 7112 transitions. [2024-11-09 07:17:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:17:27,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:27,900 INFO L215 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] [2024-11-09 07:17:27,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:17:27,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2075802650, now seen corresponding path program 1 times [2024-11-09 07:17:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:27,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125487705] [2024-11-09 07:17:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:29,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:29,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125487705] [2024-11-09 07:17:29,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125487705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:29,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:29,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:17:29,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044988719] [2024-11-09 07:17:29,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:29,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:17:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:29,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:17:29,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:17:29,114 INFO L87 Difference]: Start difference. First operand 2249 states and 7112 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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) [2024-11-09 07:17:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:29,462 INFO L93 Difference]: Finished difference Result 2749 states and 8585 transitions. [2024-11-09 07:17:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:17:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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 [2024-11-09 07:17:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:29,478 INFO L225 Difference]: With dead ends: 2749 [2024-11-09 07:17:29,478 INFO L226 Difference]: Without dead ends: 2404 [2024-11-09 07:17:29,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:17:29,481 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 64 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:29,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 229 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:17:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-11-09 07:17:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2234. [2024-11-09 07:17:29,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2234 states, 2233 states have (on average 3.149126735333632) internal successors, (7032), 2233 states have internal predecessors, (7032), 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) [2024-11-09 07:17:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2234 states to 2234 states and 7032 transitions. [2024-11-09 07:17:29,557 INFO L78 Accepts]: Start accepts. Automaton has 2234 states and 7032 transitions. Word has length 22 [2024-11-09 07:17:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:29,559 INFO L471 AbstractCegarLoop]: Abstraction has 2234 states and 7032 transitions. [2024-11-09 07:17:29,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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) [2024-11-09 07:17:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2234 states and 7032 transitions. [2024-11-09 07:17:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:17:29,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:29,564 INFO L215 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] [2024-11-09 07:17:29,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:17:29,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:29,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:29,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1438573160, now seen corresponding path program 2 times [2024-11-09 07:17:29,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:29,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694612516] [2024-11-09 07:17:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:29,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:30,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694612516] [2024-11-09 07:17:30,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694612516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:30,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:30,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:17:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512029944] [2024-11-09 07:17:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:30,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:17:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:30,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:17:30,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:17:30,593 INFO L87 Difference]: Start difference. First operand 2234 states and 7032 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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) [2024-11-09 07:17:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:31,006 INFO L93 Difference]: Finished difference Result 2775 states and 8593 transitions. [2024-11-09 07:17:31,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:17:31,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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 [2024-11-09 07:17:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:31,021 INFO L225 Difference]: With dead ends: 2775 [2024-11-09 07:17:31,021 INFO L226 Difference]: Without dead ends: 2250 [2024-11-09 07:17:31,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:17:31,026 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:31,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 192 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:17:31,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2024-11-09 07:17:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2144. [2024-11-09 07:17:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2144 states, 2143 states have (on average 3.134857676154923) internal successors, (6718), 2143 states have internal predecessors, (6718), 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) [2024-11-09 07:17:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 6718 transitions. [2024-11-09 07:17:31,095 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 6718 transitions. Word has length 22 [2024-11-09 07:17:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:31,096 INFO L471 AbstractCegarLoop]: Abstraction has 2144 states and 6718 transitions. [2024-11-09 07:17:31,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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) [2024-11-09 07:17:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 6718 transitions. [2024-11-09 07:17:31,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:17:31,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:31,102 INFO L215 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] [2024-11-09 07:17:31,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:17:31,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:31,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1814648424, now seen corresponding path program 3 times [2024-11-09 07:17:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660899377] [2024-11-09 07:17:31,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:32,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:32,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660899377] [2024-11-09 07:17:32,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660899377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:32,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:32,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:17:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650365644] [2024-11-09 07:17:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:32,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:17:32,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:32,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:17:32,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:17:32,413 INFO L87 Difference]: Start difference. First operand 2144 states and 6718 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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) [2024-11-09 07:17:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:32,861 INFO L93 Difference]: Finished difference Result 2644 states and 8191 transitions. [2024-11-09 07:17:32,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:17:32,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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 [2024-11-09 07:17:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:32,880 INFO L225 Difference]: With dead ends: 2644 [2024-11-09 07:17:32,880 INFO L226 Difference]: Without dead ends: 2184 [2024-11-09 07:17:32,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:17:32,885 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:32,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 218 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:17:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2024-11-09 07:17:32,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2109. [2024-11-09 07:17:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2109 states, 2108 states have (on average 3.128557874762808) internal successors, (6595), 2108 states have internal predecessors, (6595), 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) [2024-11-09 07:17:32,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 6595 transitions. [2024-11-09 07:17:32,958 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 6595 transitions. Word has length 22 [2024-11-09 07:17:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:32,958 INFO L471 AbstractCegarLoop]: Abstraction has 2109 states and 6595 transitions. [2024-11-09 07:17:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 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) [2024-11-09 07:17:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 6595 transitions. [2024-11-09 07:17:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:17:32,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:32,964 INFO L215 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] [2024-11-09 07:17:32,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:17:32,964 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:32,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:32,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1620384102, now seen corresponding path program 4 times [2024-11-09 07:17:32,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:32,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89619494] [2024-11-09 07:17:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:33,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:33,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89619494] [2024-11-09 07:17:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89619494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:33,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:17:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785710916] [2024-11-09 07:17:33,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:33,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:17:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:17:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:17:33,144 INFO L87 Difference]: Start difference. First operand 2109 states and 6595 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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) [2024-11-09 07:17:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:33,258 INFO L93 Difference]: Finished difference Result 3069 states and 9405 transitions. [2024-11-09 07:17:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:17:33,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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 [2024-11-09 07:17:33,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:33,273 INFO L225 Difference]: With dead ends: 3069 [2024-11-09 07:17:33,273 INFO L226 Difference]: Without dead ends: 1680 [2024-11-09 07:17:33,276 INFO L431 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 [2024-11-09 07:17:33,277 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:33,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 36 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:17:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-11-09 07:17:33,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1680. [2024-11-09 07:17:33,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1679 states have (on average 2.97736748064324) internal successors, (4999), 1679 states have internal predecessors, (4999), 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) [2024-11-09 07:17:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 4999 transitions. [2024-11-09 07:17:33,329 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 4999 transitions. Word has length 22 [2024-11-09 07:17:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:33,329 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 4999 transitions. [2024-11-09 07:17:33,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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) [2024-11-09 07:17:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 4999 transitions. [2024-11-09 07:17:33,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:17:33,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:33,334 INFO L215 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, 1] [2024-11-09 07:17:33,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:17:33,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash 358231942, now seen corresponding path program 1 times [2024-11-09 07:17:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:33,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99821603] [2024-11-09 07:17:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:34,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:34,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99821603] [2024-11-09 07:17:34,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99821603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:34,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:34,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:17:34,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540782536] [2024-11-09 07:17:34,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:34,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:17:34,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:34,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:17:34,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:17:34,282 INFO L87 Difference]: Start difference. First operand 1680 states and 4999 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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) [2024-11-09 07:17:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:34,754 INFO L93 Difference]: Finished difference Result 1884 states and 5571 transitions. [2024-11-09 07:17:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:17:34,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 23 [2024-11-09 07:17:34,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:34,764 INFO L225 Difference]: With dead ends: 1884 [2024-11-09 07:17:34,764 INFO L226 Difference]: Without dead ends: 1378 [2024-11-09 07:17:34,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:17:34,766 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 94 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:34,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 271 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:17:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-09 07:17:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1248. [2024-11-09 07:17:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1247 states have (on average 3.0272654370489174) internal successors, (3775), 1247 states have internal predecessors, (3775), 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) [2024-11-09 07:17:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 3775 transitions. [2024-11-09 07:17:34,808 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 3775 transitions. Word has length 23 [2024-11-09 07:17:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:34,808 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 3775 transitions. [2024-11-09 07:17:34,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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) [2024-11-09 07:17:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 3775 transitions. [2024-11-09 07:17:34,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:17:34,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:34,811 INFO L215 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, 1] [2024-11-09 07:17:34,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:17:34,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:34,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 89786853, now seen corresponding path program 1 times [2024-11-09 07:17:34,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:34,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047525203] [2024-11-09 07:17:34,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:34,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:34,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:34,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047525203] [2024-11-09 07:17:34,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047525203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:34,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:34,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:17:34,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38985765] [2024-11-09 07:17:34,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:34,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:17:34,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:34,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:17:34,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:17:34,994 INFO L87 Difference]: Start difference. First operand 1248 states and 3775 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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) [2024-11-09 07:17:35,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:35,129 INFO L93 Difference]: Finished difference Result 1560 states and 4615 transitions. [2024-11-09 07:17:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:17:35,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-09 07:17:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:35,139 INFO L225 Difference]: With dead ends: 1560 [2024-11-09 07:17:35,139 INFO L226 Difference]: Without dead ends: 822 [2024-11-09 07:17:35,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:17:35,142 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:35,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 43 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:17:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-09 07:17:35,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2024-11-09 07:17:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 821 states have (on average 2.8404384896467723) internal successors, (2332), 821 states have internal predecessors, (2332), 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) [2024-11-09 07:17:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 2332 transitions. [2024-11-09 07:17:35,169 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 2332 transitions. Word has length 23 [2024-11-09 07:17:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:35,170 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 2332 transitions. [2024-11-09 07:17:35,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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) [2024-11-09 07:17:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 2332 transitions. [2024-11-09 07:17:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:17:35,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:35,173 INFO L215 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, 1, 1, 1, 1] [2024-11-09 07:17:35,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:17:35,173 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1001559696, now seen corresponding path program 1 times [2024-11-09 07:17:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62394773] [2024-11-09 07:17:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:35,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:35,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62394773] [2024-11-09 07:17:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62394773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:35,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:17:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601429090] [2024-11-09 07:17:35,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:35,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:17:35,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:17:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:17:35,439 INFO L87 Difference]: Start difference. First operand 822 states and 2332 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-09 07:17:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:35,579 INFO L93 Difference]: Finished difference Result 878 states and 2464 transitions. [2024-11-09 07:17:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:17:35,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-11-09 07:17:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:35,588 INFO L225 Difference]: With dead ends: 878 [2024-11-09 07:17:35,588 INFO L226 Difference]: Without dead ends: 366 [2024-11-09 07:17:35,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:17:35,590 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 108 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:35,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 30 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:17:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-09 07:17:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-11-09 07:17:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 2.728767123287671) internal successors, (996), 365 states have internal predecessors, (996), 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) [2024-11-09 07:17:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 996 transitions. [2024-11-09 07:17:35,607 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 996 transitions. Word has length 26 [2024-11-09 07:17:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:35,608 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 996 transitions. [2024-11-09 07:17:35,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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) [2024-11-09 07:17:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 996 transitions. [2024-11-09 07:17:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:17:35,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:35,610 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:35,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:17:35,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1453672061, now seen corresponding path program 1 times [2024-11-09 07:17:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697146272] [2024-11-09 07:17:35,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:17:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:17:36,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:17:36,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697146272] [2024-11-09 07:17:36,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697146272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:17:36,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:17:36,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:17:36,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638850571] [2024-11-09 07:17:36,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:17:36,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:17:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:17:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:17:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:17:36,672 INFO L87 Difference]: Start difference. First operand 366 states and 996 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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) [2024-11-09 07:17:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:17:36,955 INFO L93 Difference]: Finished difference Result 518 states and 1392 transitions. [2024-11-09 07:17:36,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:17:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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 29 [2024-11-09 07:17:36,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:17:36,962 INFO L225 Difference]: With dead ends: 518 [2024-11-09 07:17:36,962 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 07:17:36,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:17:36,964 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:17:36,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 112 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:17:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 07:17:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-09 07:17:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.544747081712062) internal successors, (654), 257 states have internal predecessors, (654), 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) [2024-11-09 07:17:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 654 transitions. [2024-11-09 07:17:36,976 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 654 transitions. Word has length 29 [2024-11-09 07:17:36,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:17:36,976 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 654 transitions. [2024-11-09 07:17:36,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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) [2024-11-09 07:17:36,977 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 654 transitions. [2024-11-09 07:17:36,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:17:36,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:17:36,978 INFO L215 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:36,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:17:36,978 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-09 07:17:36,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:17:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash -891403901, now seen corresponding path program 2 times [2024-11-09 07:17:36,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:17:36,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090711859] [2024-11-09 07:17:36,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:17:36,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:17:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:17:37,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:17:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:17:37,122 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 07:17:37,122 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:17:37,123 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-09 07:17:37,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-09 07:17:37,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-09 07:17:37,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-09 07:17:37,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-09 07:17:37,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-09 07:17:37,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:17:37,130 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:17:37,188 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:17:37,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:17:37,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:17:37 BasicIcfg [2024-11-09 07:17:37,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:17:37,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:17:37,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:17:37,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:17:37,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:17:18" (3/4) ... [2024-11-09 07:17:37,194 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 07:17:37,290 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 07:17:37,290 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:17:37,291 INFO L158 Benchmark]: Toolchain (without parser) took 20990.83ms. Allocated memory was 161.5MB in the beginning and 671.1MB in the end (delta: 509.6MB). Free memory was 122.2MB in the beginning and 413.1MB in the end (delta: -290.9MB). Peak memory consumption was 219.7MB. Max. memory is 16.1GB. [2024-11-09 07:17:37,291 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:17:37,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.95ms. Allocated memory is still 161.5MB. Free memory was 122.2MB in the beginning and 96.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 07:17:37,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.08ms. Allocated memory is still 161.5MB. Free memory was 96.7MB in the beginning and 93.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:17:37,292 INFO L158 Benchmark]: Boogie Preprocessor took 42.69ms. Allocated memory is still 161.5MB. Free memory was 93.9MB in the beginning and 92.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:17:37,292 INFO L158 Benchmark]: RCFGBuilder took 885.87ms. Allocated memory is still 161.5MB. Free memory was 92.0MB in the beginning and 85.8MB in the end (delta: 6.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-09 07:17:37,292 INFO L158 Benchmark]: TraceAbstraction took 19078.71ms. Allocated memory was 161.5MB in the beginning and 671.1MB in the end (delta: 509.6MB). Free memory was 84.9MB in the beginning and 424.7MB in the end (delta: -339.8MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. [2024-11-09 07:17:37,292 INFO L158 Benchmark]: Witness Printer took 97.88ms. Allocated memory is still 671.1MB. Free memory was 424.7MB in the beginning and 413.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 07:17:37,298 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.22ms. Allocated memory is still 125.8MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.95ms. Allocated memory is still 161.5MB. Free memory was 122.2MB in the beginning and 96.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.08ms. Allocated memory is still 161.5MB. Free memory was 96.7MB in the beginning and 93.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.69ms. Allocated memory is still 161.5MB. Free memory was 93.9MB in the beginning and 92.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 885.87ms. Allocated memory is still 161.5MB. Free memory was 92.0MB in the beginning and 85.8MB in the end (delta: 6.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 19078.71ms. Allocated memory was 161.5MB in the beginning and 671.1MB in the end (delta: 509.6MB). Free memory was 84.9MB in the beginning and 424.7MB in the end (delta: -339.8MB). Peak memory consumption was 169.7MB. Max. memory is 16.1GB. * Witness Printer took 97.88ms. Allocated memory is still 671.1MB. Free memory was 424.7MB in the beginning and 413.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, t2493=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L786] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L739] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L742] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L754] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L757] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492=-2, t2493=-1, t2494=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - 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: 816]: 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: 812]: 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: 814]: 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, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1150 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1150 mSDsluCounter, 1988 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1519 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2087 IncrementalHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 469 mSDtfsCounter, 2087 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3936occurred in iteration=0, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 3175 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 2780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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! [2024-11-09 07:17:37,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e9488866-87b1-46dd-8f98-ebbfea8cdf66/bin/utaipan-verify-YMUCfTKeje/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