./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:04:11,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:04:11,159 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:04:11,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:04:11,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:04:11,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:04:11,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:04:11,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:04:11,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:04:11,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:04:11,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:04:11,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:04:11,197 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:04:11,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:04:11,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:04:11,199 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:04:11,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:04:11,200 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:04:11,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:04:11,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:04:11,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:04:11,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:04:11,202 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:04:11,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:04:11,203 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:04:11,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:04:11,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:04:11,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:04:11,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:11,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:04:11,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:04:11,206 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:04:11,206 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:04:11,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:04:11,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:04:11,207 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:04:11,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:04:11,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:04:11,207 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:04:11,208 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/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_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu 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 -> Automizer 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 -> 2bbc774c97831725ad05d6c2dc910981cb4ce0a2559ec0561efc45418b96b7a4 [2023-11-19 08:04:11,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:04:11,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:04:11,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:04:11,543 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:04:11,544 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:04:11,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-19 08:04:14,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:04:14,919 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:04:14,919 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-19 08:04:14,939 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/data/c6429eabc/b8fd79588b24418daaf39be5f226465e/FLAGdfe8a2fcc [2023-11-19 08:04:14,954 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/data/c6429eabc/b8fd79588b24418daaf39be5f226465e [2023-11-19 08:04:14,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:04:14,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:04:14,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:14,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:04:14,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:04:14,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:14" (1/1) ... [2023-11-19 08:04:14,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3ff991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:14, skipping insertion in model container [2023-11-19 08:04:14,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:14" (1/1) ... [2023-11-19 08:04:15,043 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:04:15,280 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-19 08:04:15,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:15,559 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:04:15,573 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/sv-benchmarks/c/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2023-11-19 08:04:15,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:15,659 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:04:15,660 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:04:15,668 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:04:15,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15 WrapperNode [2023-11-19 08:04:15,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:15,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:15,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:04:15,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:04:15,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,731 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-11-19 08:04:15,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:15,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:04:15,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:04:15,733 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:04:15,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:04:15,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:04:15,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:04:15,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:04:15,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (1/1) ... [2023-11-19 08:04:15,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:15,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:15,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:04:15,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:04:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:04:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:04:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:04:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:04:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:04:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:04:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:04:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:04:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:04:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:04:15,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:04:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:04:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:04:15,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:04:15,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:04:15,907 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:04:16,122 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:04:16,124 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:04:16,490 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:04:16,681 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:04:16,681 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:04:16,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:16 BoogieIcfgContainer [2023-11-19 08:04:16,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:04:16,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:04:16,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:04:16,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:04:16,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:04:14" (1/3) ... [2023-11-19 08:04:16,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d114899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:16, skipping insertion in model container [2023-11-19 08:04:16,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:15" (2/3) ... [2023-11-19 08:04:16,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d114899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:16, skipping insertion in model container [2023-11-19 08:04:16,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:16" (3/3) ... [2023-11-19 08:04:16,696 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2023-11-19 08:04:16,706 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:04:16,718 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:04:16,718 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-19 08:04:16,719 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:04:16,786 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:04:16,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 111 transitions, 234 flow [2023-11-19 08:04:16,907 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-19 08:04:16,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:16,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 08:04:16,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 111 transitions, 234 flow [2023-11-19 08:04:16,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 108 transitions, 225 flow [2023-11-19 08:04:16,929 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:16,940 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-19 08:04:16,943 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 225 flow [2023-11-19 08:04:16,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 225 flow [2023-11-19 08:04:16,975 INFO L124 PetriNetUnfolderBase]: 3/108 cut-off events. [2023-11-19 08:04:16,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:16,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 3/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2023-11-19 08:04:16,980 INFO L119 LiptonReduction]: Number of co-enabled transitions 2218 [2023-11-19 08:04:21,939 INFO L134 LiptonReduction]: Checked pairs total: 5217 [2023-11-19 08:04:21,939 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-19 08:04:21,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:21,967 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@3b5471ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:21,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 08:04:21,971 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:21,971 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-19 08:04:21,971 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:21,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:21,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:04:21,973 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:21,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash 483494, now seen corresponding path program 1 times [2023-11-19 08:04:21,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436006236] [2023-11-19 08:04:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:22,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436006236] [2023-11-19 08:04:22,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436006236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:22,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:22,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921339162] [2023-11-19 08:04:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:22,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:22,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:22,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:22,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:22,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-11-19 08:04:22,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:22,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:22,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-11-19 08:04:22,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:22,983 INFO L124 PetriNetUnfolderBase]: 711/1169 cut-off events. [2023-11-19 08:04:22,984 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 08:04:22,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 1169 events. 711/1169 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6127 event pairs, 111 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 2277. Up to 871 conditions per place. [2023-11-19 08:04:23,003 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-11-19 08:04:23,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2023-11-19 08:04:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-19 08:04:23,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2023-11-19 08:04:23,025 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-19 08:04:23,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-19 08:04:23,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:23,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-19 08:04:23,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:23,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:23,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:23,048 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 322 transitions. [2023-11-19 08:04:23,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2023-11-19 08:04:23,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:04:23,054 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2023-11-19 08:04:23,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 08:04:23,061 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2023-11-19 08:04:23,061 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2023-11-19 08:04:23,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:23,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:23,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:23,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:04:23,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:23,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1377280256, now seen corresponding path program 1 times [2023-11-19 08:04:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514195125] [2023-11-19 08:04:23,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:24,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:24,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514195125] [2023-11-19 08:04:24,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514195125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:24,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:24,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:24,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418574700] [2023-11-19 08:04:24,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:24,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:24,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:24,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-19 08:04:24,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:24,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-19 08:04:24,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:24,750 INFO L124 PetriNetUnfolderBase]: 768/1231 cut-off events. [2023-11-19 08:04:24,751 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-19 08:04:24,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 1231 events. 768/1231 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5668 event pairs, 184 based on Foata normal form. 32/1258 useless extension candidates. Maximal degree in co-relation 2514. Up to 825 conditions per place. [2023-11-19 08:04:24,763 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 28 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2023-11-19 08:04:24,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 160 flow [2023-11-19 08:04:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-11-19 08:04:24,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-11-19 08:04:24,770 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-11-19 08:04:24,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-11-19 08:04:24,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:24,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-11-19 08:04:24,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,781 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,781 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 390 transitions. [2023-11-19 08:04:24,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 160 flow [2023-11-19 08:04:24,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:24,784 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 108 flow [2023-11-19 08:04:24,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-11-19 08:04:24,785 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-11-19 08:04:24,785 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 108 flow [2023-11-19 08:04:24,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.25) internal successors, (361), 4 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:24,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:24,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:24,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:04:24,787 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:24,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -253986372, now seen corresponding path program 1 times [2023-11-19 08:04:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:24,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706286258] [2023-11-19 08:04:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:25,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706286258] [2023-11-19 08:04:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706286258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:25,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:25,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560329622] [2023-11-19 08:04:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:25,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:25,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-19 08:04:25,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:25,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:25,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-19 08:04:25,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:26,340 INFO L124 PetriNetUnfolderBase]: 1126/1704 cut-off events. [2023-11-19 08:04:26,341 INFO L125 PetriNetUnfolderBase]: For 891/912 co-relation queries the response was YES. [2023-11-19 08:04:26,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 1704 events. 1126/1704 cut-off events. For 891/912 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7827 event pairs, 109 based on Foata normal form. 15/1707 useless extension candidates. Maximal degree in co-relation 4756. Up to 911 conditions per place. [2023-11-19 08:04:26,357 INFO L140 encePairwiseOnDemand]: 199/210 looper letters, 43 selfloop transitions, 27 changer transitions 0/71 dead transitions. [2023-11-19 08:04:26,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 71 transitions, 408 flow [2023-11-19 08:04:26,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:04:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:04:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-11-19 08:04:26,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2023-11-19 08:04:26,361 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-11-19 08:04:26,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-11-19 08:04:26,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:26,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-11-19 08:04:26,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,368 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,368 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 108 flow. Second operand 5 states and 492 transitions. [2023-11-19 08:04:26,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 71 transitions, 408 flow [2023-11-19 08:04:26,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 71 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:26,374 INFO L231 Difference]: Finished difference. Result has 41 places, 46 transitions, 328 flow [2023-11-19 08:04:26,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=41, PETRI_TRANSITIONS=46} [2023-11-19 08:04:26,375 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2023-11-19 08:04:26,375 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 46 transitions, 328 flow [2023-11-19 08:04:26,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:26,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:26,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:26,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:04:26,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:26,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash -255451122, now seen corresponding path program 2 times [2023-11-19 08:04:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:26,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300271213] [2023-11-19 08:04:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:27,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:27,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300271213] [2023-11-19 08:04:27,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300271213] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:27,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:27,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730891888] [2023-11-19 08:04:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:27,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:27,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:27,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:27,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 210 [2023-11-19 08:04:27,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 46 transitions, 328 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:27,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 210 [2023-11-19 08:04:27,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:27,610 INFO L124 PetriNetUnfolderBase]: 1018/1612 cut-off events. [2023-11-19 08:04:27,610 INFO L125 PetriNetUnfolderBase]: For 2909/2974 co-relation queries the response was YES. [2023-11-19 08:04:27,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6432 conditions, 1612 events. 1018/1612 cut-off events. For 2909/2974 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7812 event pairs, 227 based on Foata normal form. 38/1649 useless extension candidates. Maximal degree in co-relation 6414. Up to 1251 conditions per place. [2023-11-19 08:04:27,631 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 49 selfloop transitions, 27 changer transitions 0/79 dead transitions. [2023-11-19 08:04:27,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 675 flow [2023-11-19 08:04:27,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2023-11-19 08:04:27,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726190476190476 [2023-11-19 08:04:27,634 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 397 transitions. [2023-11-19 08:04:27,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 397 transitions. [2023-11-19 08:04:27,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:27,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 397 transitions. [2023-11-19 08:04:27,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,639 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,640 INFO L175 Difference]: Start difference. First operand has 41 places, 46 transitions, 328 flow. Second operand 4 states and 397 transitions. [2023-11-19 08:04:27,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 675 flow [2023-11-19 08:04:27,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 675 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:27,653 INFO L231 Difference]: Finished difference. Result has 46 places, 58 transitions, 529 flow [2023-11-19 08:04:27,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=529, PETRI_PLACES=46, PETRI_TRANSITIONS=58} [2023-11-19 08:04:27,654 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-11-19 08:04:27,654 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 58 transitions, 529 flow [2023-11-19 08:04:27,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:27,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:27,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:27,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:04:27,656 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:27,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash 714695879, now seen corresponding path program 1 times [2023-11-19 08:04:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:27,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989632632] [2023-11-19 08:04:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:28,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989632632] [2023-11-19 08:04:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989632632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:28,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:28,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:28,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869614081] [2023-11-19 08:04:28,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:28,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:28,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:28,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 210 [2023-11-19 08:04:28,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 58 transitions, 529 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:28,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:28,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 210 [2023-11-19 08:04:28,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:28,983 INFO L124 PetriNetUnfolderBase]: 1339/2098 cut-off events. [2023-11-19 08:04:28,984 INFO L125 PetriNetUnfolderBase]: For 6113/6252 co-relation queries the response was YES. [2023-11-19 08:04:28,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9001 conditions, 2098 events. 1339/2098 cut-off events. For 6113/6252 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10324 event pairs, 189 based on Foata normal form. 126/2221 useless extension candidates. Maximal degree in co-relation 8979. Up to 914 conditions per place. [2023-11-19 08:04:29,001 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 46 selfloop transitions, 10 changer transitions 29/86 dead transitions. [2023-11-19 08:04:29,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 880 flow [2023-11-19 08:04:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:04:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:04:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-11-19 08:04:29,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2023-11-19 08:04:29,004 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-11-19 08:04:29,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-11-19 08:04:29,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:29,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-11-19 08:04:29,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,011 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,011 INFO L175 Difference]: Start difference. First operand has 46 places, 58 transitions, 529 flow. Second operand 5 states and 480 transitions. [2023-11-19 08:04:29,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 880 flow [2023-11-19 08:04:29,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 876 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:29,029 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 361 flow [2023-11-19 08:04:29,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-11-19 08:04:29,032 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2023-11-19 08:04:29,033 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 361 flow [2023-11-19 08:04:29,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:29,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:29,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:04:29,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:29,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:29,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2097385413, now seen corresponding path program 1 times [2023-11-19 08:04:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986197313] [2023-11-19 08:04:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:29,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986197313] [2023-11-19 08:04:29,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986197313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:29,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:29,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:29,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974340338] [2023-11-19 08:04:29,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:29,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:29,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:29,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:29,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:29,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 210 [2023-11-19 08:04:29,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:29,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:29,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 210 [2023-11-19 08:04:29,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:30,061 INFO L124 PetriNetUnfolderBase]: 717/1128 cut-off events. [2023-11-19 08:04:30,062 INFO L125 PetriNetUnfolderBase]: For 4263/4316 co-relation queries the response was YES. [2023-11-19 08:04:30,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5238 conditions, 1128 events. 717/1128 cut-off events. For 4263/4316 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4673 event pairs, 217 based on Foata normal form. 49/1172 useless extension candidates. Maximal degree in co-relation 5212. Up to 976 conditions per place. [2023-11-19 08:04:30,078 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 49 selfloop transitions, 13 changer transitions 0/68 dead transitions. [2023-11-19 08:04:30,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 686 flow [2023-11-19 08:04:30,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2023-11-19 08:04:30,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-11-19 08:04:30,082 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2023-11-19 08:04:30,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2023-11-19 08:04:30,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:30,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2023-11-19 08:04:30,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,087 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,088 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 361 flow. Second operand 4 states and 427 transitions. [2023-11-19 08:04:30,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 686 flow [2023-11-19 08:04:30,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 598 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-11-19 08:04:30,099 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 418 flow [2023-11-19 08:04:30,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=418, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2023-11-19 08:04:30,100 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2023-11-19 08:04:30,101 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 418 flow [2023-11-19 08:04:30,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:30,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:30,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:30,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:04:30,102 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:30,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:30,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2128590232, now seen corresponding path program 1 times [2023-11-19 08:04:30,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:30,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825650596] [2023-11-19 08:04:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:31,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:31,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825650596] [2023-11-19 08:04:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825650596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:31,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:31,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776160162] [2023-11-19 08:04:31,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:31,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:31,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:31,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:31,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 210 [2023-11-19 08:04:31,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 418 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:31,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:31,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 210 [2023-11-19 08:04:31,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:31,693 INFO L124 PetriNetUnfolderBase]: 803/1245 cut-off events. [2023-11-19 08:04:31,694 INFO L125 PetriNetUnfolderBase]: For 3574/3575 co-relation queries the response was YES. [2023-11-19 08:04:31,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5706 conditions, 1245 events. 803/1245 cut-off events. For 3574/3575 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5026 event pairs, 290 based on Foata normal form. 5/1249 useless extension candidates. Maximal degree in co-relation 5682. Up to 1005 conditions per place. [2023-11-19 08:04:31,708 INFO L140 encePairwiseOnDemand]: 199/210 looper letters, 43 selfloop transitions, 28 changer transitions 0/73 dead transitions. [2023-11-19 08:04:31,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 674 flow [2023-11-19 08:04:31,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 397 transitions. [2023-11-19 08:04:31,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726190476190476 [2023-11-19 08:04:31,711 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 397 transitions. [2023-11-19 08:04:31,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 397 transitions. [2023-11-19 08:04:31,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:31,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 397 transitions. [2023-11-19 08:04:31,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:31,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:31,716 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:31,716 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 418 flow. Second operand 4 states and 397 transitions. [2023-11-19 08:04:31,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 674 flow [2023-11-19 08:04:31,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:31,728 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 562 flow [2023-11-19 08:04:31,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=562, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2023-11-19 08:04:31,729 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2023-11-19 08:04:31,729 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 562 flow [2023-11-19 08:04:31,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:31,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:31,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:31,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:04:31,730 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:31,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:31,731 INFO L85 PathProgramCache]: Analyzing trace with hash 501572516, now seen corresponding path program 1 times [2023-11-19 08:04:31,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:31,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368650070] [2023-11-19 08:04:31,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:31,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:32,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368650070] [2023-11-19 08:04:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368650070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:32,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413788774] [2023-11-19 08:04:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:32,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:32,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-11-19 08:04:32,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 562 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:32,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-11-19 08:04:32,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:32,566 INFO L124 PetriNetUnfolderBase]: 709/1119 cut-off events. [2023-11-19 08:04:32,567 INFO L125 PetriNetUnfolderBase]: For 5538/5615 co-relation queries the response was YES. [2023-11-19 08:04:32,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 1119 events. 709/1119 cut-off events. For 5538/5615 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4609 event pairs, 284 based on Foata normal form. 64/1181 useless extension candidates. Maximal degree in co-relation 5984. Up to 912 conditions per place. [2023-11-19 08:04:32,582 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 56 selfloop transitions, 8 changer transitions 0/70 dead transitions. [2023-11-19 08:04:32,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 771 flow [2023-11-19 08:04:32,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:32,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:32,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-11-19 08:04:32,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2023-11-19 08:04:32,585 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-11-19 08:04:32,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-11-19 08:04:32,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:32,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-11-19 08:04:32,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,591 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,591 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 562 flow. Second operand 4 states and 414 transitions. [2023-11-19 08:04:32,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 771 flow [2023-11-19 08:04:32,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 769 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:32,603 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 582 flow [2023-11-19 08:04:32,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-11-19 08:04:32,606 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2023-11-19 08:04:32,606 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 582 flow [2023-11-19 08:04:32,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:32,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:32,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:32,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:04:32,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:32,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash -837086075, now seen corresponding path program 1 times [2023-11-19 08:04:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072883516] [2023-11-19 08:04:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:32,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:33,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:33,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072883516] [2023-11-19 08:04:33,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072883516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:33,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:33,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:33,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581239591] [2023-11-19 08:04:33,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:33,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:33,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:33,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:33,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:33,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 210 [2023-11-19 08:04:33,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:33,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 210 [2023-11-19 08:04:33,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:33,871 INFO L124 PetriNetUnfolderBase]: 692/1080 cut-off events. [2023-11-19 08:04:33,871 INFO L125 PetriNetUnfolderBase]: For 6047/6148 co-relation queries the response was YES. [2023-11-19 08:04:33,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5934 conditions, 1080 events. 692/1080 cut-off events. For 6047/6148 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4422 event pairs, 233 based on Foata normal form. 92/1158 useless extension candidates. Maximal degree in co-relation 5903. Up to 809 conditions per place. [2023-11-19 08:04:33,896 INFO L140 encePairwiseOnDemand]: 206/210 looper letters, 50 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2023-11-19 08:04:33,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 798 flow [2023-11-19 08:04:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:33,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:33,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-19 08:04:33,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-19 08:04:33,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-19 08:04:33,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-19 08:04:33,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:33,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-19 08:04:33,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,904 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,904 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 582 flow. Second operand 3 states and 315 transitions. [2023-11-19 08:04:33,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 798 flow [2023-11-19 08:04:33,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 784 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:33,917 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 645 flow [2023-11-19 08:04:33,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-11-19 08:04:33,918 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2023-11-19 08:04:33,919 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 645 flow [2023-11-19 08:04:33,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:33,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:33,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:33,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:04:33,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:33,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash -706054743, now seen corresponding path program 1 times [2023-11-19 08:04:33,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:33,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198989529] [2023-11-19 08:04:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:34,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198989529] [2023-11-19 08:04:34,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198989529] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:34,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:34,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154674208] [2023-11-19 08:04:34,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:34,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:34,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:34,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:34,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-19 08:04:34,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 645 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:34,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:34,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-19 08:04:34,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:34,776 INFO L124 PetriNetUnfolderBase]: 779/1226 cut-off events. [2023-11-19 08:04:34,776 INFO L125 PetriNetUnfolderBase]: For 7125/7183 co-relation queries the response was YES. [2023-11-19 08:04:34,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6961 conditions, 1226 events. 779/1226 cut-off events. For 7125/7183 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5159 event pairs, 261 based on Foata normal form. 63/1283 useless extension candidates. Maximal degree in co-relation 6929. Up to 926 conditions per place. [2023-11-19 08:04:34,790 INFO L140 encePairwiseOnDemand]: 202/210 looper letters, 55 selfloop transitions, 22 changer transitions 0/83 dead transitions. [2023-11-19 08:04:34,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 984 flow [2023-11-19 08:04:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 598 transitions. [2023-11-19 08:04:34,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746031746031746 [2023-11-19 08:04:34,794 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 598 transitions. [2023-11-19 08:04:34,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 598 transitions. [2023-11-19 08:04:34,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:34,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 598 transitions. [2023-11-19 08:04:34,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:34,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:34,803 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:34,803 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 645 flow. Second operand 6 states and 598 transitions. [2023-11-19 08:04:34,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 984 flow [2023-11-19 08:04:34,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 966 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:34,825 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 809 flow [2023-11-19 08:04:34,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=809, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2023-11-19 08:04:34,827 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2023-11-19 08:04:34,827 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 809 flow [2023-11-19 08:04:34,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:34,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:34,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:34,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:04:34,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:34,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash -835835039, now seen corresponding path program 2 times [2023-11-19 08:04:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442955795] [2023-11-19 08:04:34,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:34,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:35,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:35,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442955795] [2023-11-19 08:04:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442955795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:35,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:35,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331171036] [2023-11-19 08:04:35,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:35,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:35,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:35,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:35,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 210 [2023-11-19 08:04:35,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 809 flow. Second operand has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:35,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:35,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 210 [2023-11-19 08:04:35,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:35,808 INFO L124 PetriNetUnfolderBase]: 836/1315 cut-off events. [2023-11-19 08:04:35,808 INFO L125 PetriNetUnfolderBase]: For 8014/8087 co-relation queries the response was YES. [2023-11-19 08:04:35,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8178 conditions, 1315 events. 836/1315 cut-off events. For 8014/8087 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5644 event pairs, 270 based on Foata normal form. 78/1385 useless extension candidates. Maximal degree in co-relation 8144. Up to 991 conditions per place. [2023-11-19 08:04:35,825 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 67 selfloop transitions, 21 changer transitions 0/94 dead transitions. [2023-11-19 08:04:35,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 94 transitions, 1276 flow [2023-11-19 08:04:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:04:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:04:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2023-11-19 08:04:35,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2023-11-19 08:04:35,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2023-11-19 08:04:35,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2023-11-19 08:04:35,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:35,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2023-11-19 08:04:35,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:35,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:35,837 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:35,837 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 809 flow. Second operand 5 states and 500 transitions. [2023-11-19 08:04:35,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 94 transitions, 1276 flow [2023-11-19 08:04:35,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 1179 flow, removed 27 selfloop flow, removed 3 redundant places. [2023-11-19 08:04:35,861 INFO L231 Difference]: Finished difference. Result has 67 places, 77 transitions, 977 flow [2023-11-19 08:04:35,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=977, PETRI_PLACES=67, PETRI_TRANSITIONS=77} [2023-11-19 08:04:35,862 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2023-11-19 08:04:35,863 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 77 transitions, 977 flow [2023-11-19 08:04:35,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.16666666666667) internal successors, (565), 6 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:35,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:35,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:35,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:04:35,864 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:35,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1619860005, now seen corresponding path program 3 times [2023-11-19 08:04:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692663334] [2023-11-19 08:04:35,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:36,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:36,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692663334] [2023-11-19 08:04:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692663334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:36,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:36,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:36,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456076491] [2023-11-19 08:04:36,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:36,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:36,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 210 [2023-11-19 08:04:36,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 77 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:36,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 210 [2023-11-19 08:04:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:36,955 INFO L124 PetriNetUnfolderBase]: 840/1329 cut-off events. [2023-11-19 08:04:36,956 INFO L125 PetriNetUnfolderBase]: For 9706/9814 co-relation queries the response was YES. [2023-11-19 08:04:36,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8561 conditions, 1329 events. 840/1329 cut-off events. For 9706/9814 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5751 event pairs, 217 based on Foata normal form. 61/1383 useless extension candidates. Maximal degree in co-relation 8526. Up to 1062 conditions per place. [2023-11-19 08:04:36,971 INFO L140 encePairwiseOnDemand]: 201/210 looper letters, 79 selfloop transitions, 30 changer transitions 0/115 dead transitions. [2023-11-19 08:04:36,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 115 transitions, 1508 flow [2023-11-19 08:04:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2023-11-19 08:04:36,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46802721088435373 [2023-11-19 08:04:36,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2023-11-19 08:04:36,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2023-11-19 08:04:36,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:36,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2023-11-19 08:04:36,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,983 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:36,983 INFO L175 Difference]: Start difference. First operand has 67 places, 77 transitions, 977 flow. Second operand 7 states and 688 transitions. [2023-11-19 08:04:36,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 115 transitions, 1508 flow [2023-11-19 08:04:37,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 115 transitions, 1484 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:37,011 INFO L231 Difference]: Finished difference. Result has 73 places, 88 transitions, 1217 flow [2023-11-19 08:04:37,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1217, PETRI_PLACES=73, PETRI_TRANSITIONS=88} [2023-11-19 08:04:37,012 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2023-11-19 08:04:37,013 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 88 transitions, 1217 flow [2023-11-19 08:04:37,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:37,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:37,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:37,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:04:37,014 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:37,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1698095239, now seen corresponding path program 4 times [2023-11-19 08:04:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3580889] [2023-11-19 08:04:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:37,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:37,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3580889] [2023-11-19 08:04:37,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3580889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:37,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106679728] [2023-11-19 08:04:37,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:37,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:38,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 210 [2023-11-19 08:04:38,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 88 transitions, 1217 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:38,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 210 [2023-11-19 08:04:38,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:38,693 INFO L124 PetriNetUnfolderBase]: 933/1452 cut-off events. [2023-11-19 08:04:38,694 INFO L125 PetriNetUnfolderBase]: For 10639/10639 co-relation queries the response was YES. [2023-11-19 08:04:38,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9570 conditions, 1452 events. 933/1452 cut-off events. For 10639/10639 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6164 event pairs, 275 based on Foata normal form. 3/1455 useless extension candidates. Maximal degree in co-relation 9533. Up to 1080 conditions per place. [2023-11-19 08:04:38,710 INFO L140 encePairwiseOnDemand]: 199/210 looper letters, 67 selfloop transitions, 60 changer transitions 0/129 dead transitions. [2023-11-19 08:04:38,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 129 transitions, 1824 flow [2023-11-19 08:04:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2023-11-19 08:04:38,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45034013605442175 [2023-11-19 08:04:38,714 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2023-11-19 08:04:38,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2023-11-19 08:04:38,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:38,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2023-11-19 08:04:38,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,721 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,721 INFO L175 Difference]: Start difference. First operand has 73 places, 88 transitions, 1217 flow. Second operand 7 states and 662 transitions. [2023-11-19 08:04:38,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 129 transitions, 1824 flow [2023-11-19 08:04:38,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 129 transitions, 1742 flow, removed 21 selfloop flow, removed 3 redundant places. [2023-11-19 08:04:38,755 INFO L231 Difference]: Finished difference. Result has 80 places, 102 transitions, 1601 flow [2023-11-19 08:04:38,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1601, PETRI_PLACES=80, PETRI_TRANSITIONS=102} [2023-11-19 08:04:38,757 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 47 predicate places. [2023-11-19 08:04:38,757 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 102 transitions, 1601 flow [2023-11-19 08:04:38,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:38,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:38,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:04:38,758 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:38,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:38,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2017267965, now seen corresponding path program 1 times [2023-11-19 08:04:38,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:38,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347839880] [2023-11-19 08:04:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:38,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:38,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347839880] [2023-11-19 08:04:38,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347839880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:38,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515025546] [2023-11-19 08:04:38,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:38,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:38,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:38,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:38,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:38,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-19 08:04:38,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 102 transitions, 1601 flow. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:38,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:38,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-19 08:04:38,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:39,319 INFO L124 PetriNetUnfolderBase]: 619/1009 cut-off events. [2023-11-19 08:04:39,319 INFO L125 PetriNetUnfolderBase]: For 17110/17337 co-relation queries the response was YES. [2023-11-19 08:04:39,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7589 conditions, 1009 events. 619/1009 cut-off events. For 17110/17337 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4677 event pairs, 66 based on Foata normal form. 276/1277 useless extension candidates. Maximal degree in co-relation 7548. Up to 567 conditions per place. [2023-11-19 08:04:39,330 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 106 selfloop transitions, 5 changer transitions 68/191 dead transitions. [2023-11-19 08:04:39,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 191 transitions, 3370 flow [2023-11-19 08:04:39,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:04:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:04:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 507 transitions. [2023-11-19 08:04:39,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-11-19 08:04:39,334 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 507 transitions. [2023-11-19 08:04:39,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 507 transitions. [2023-11-19 08:04:39,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:39,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 507 transitions. [2023-11-19 08:04:39,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,340 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,340 INFO L175 Difference]: Start difference. First operand has 80 places, 102 transitions, 1601 flow. Second operand 5 states and 507 transitions. [2023-11-19 08:04:39,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 191 transitions, 3370 flow [2023-11-19 08:04:39,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 191 transitions, 3250 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:39,379 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 1357 flow [2023-11-19 08:04:39,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1357, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2023-11-19 08:04:39,380 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2023-11-19 08:04:39,381 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 1357 flow [2023-11-19 08:04:39,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 4 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:39,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:39,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:04:39,382 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:39,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:39,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2036794145, now seen corresponding path program 1 times [2023-11-19 08:04:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:39,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427251779] [2023-11-19 08:04:39,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:39,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:39,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:39,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427251779] [2023-11-19 08:04:39,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427251779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:39,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:39,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911117349] [2023-11-19 08:04:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:39,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:39,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:39,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:39,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-19 08:04:39,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 1357 flow. Second operand has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:39,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-19 08:04:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:39,896 INFO L124 PetriNetUnfolderBase]: 398/671 cut-off events. [2023-11-19 08:04:39,896 INFO L125 PetriNetUnfolderBase]: For 11796/11918 co-relation queries the response was YES. [2023-11-19 08:04:39,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 671 events. 398/671 cut-off events. For 11796/11918 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2929 event pairs, 32 based on Foata normal form. 164/826 useless extension candidates. Maximal degree in co-relation 5090. Up to 349 conditions per place. [2023-11-19 08:04:39,903 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 97 selfloop transitions, 8 changer transitions 76/193 dead transitions. [2023-11-19 08:04:39,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 193 transitions, 3312 flow [2023-11-19 08:04:39,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2023-11-19 08:04:39,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2023-11-19 08:04:39,907 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2023-11-19 08:04:39,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2023-11-19 08:04:39,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:39,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2023-11-19 08:04:39,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,914 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,915 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 1357 flow. Second operand 7 states and 705 transitions. [2023-11-19 08:04:39,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 193 transitions, 3312 flow [2023-11-19 08:04:39,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 193 transitions, 3092 flow, removed 65 selfloop flow, removed 7 redundant places. [2023-11-19 08:04:39,945 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 1051 flow [2023-11-19 08:04:39,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1051, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2023-11-19 08:04:39,947 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 53 predicate places. [2023-11-19 08:04:39,947 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 1051 flow [2023-11-19 08:04:39,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:39,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:39,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:39,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:04:39,948 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:39,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash -964147419, now seen corresponding path program 1 times [2023-11-19 08:04:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:39,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639981957] [2023-11-19 08:04:39,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:39,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639981957] [2023-11-19 08:04:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639981957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:40,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:40,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:40,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385444886] [2023-11-19 08:04:40,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:40,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:40,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 210 [2023-11-19 08:04:40,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:40,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:40,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 210 [2023-11-19 08:04:40,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:40,445 INFO L124 PetriNetUnfolderBase]: 302/514 cut-off events. [2023-11-19 08:04:40,445 INFO L125 PetriNetUnfolderBase]: For 5670/5716 co-relation queries the response was YES. [2023-11-19 08:04:40,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3783 conditions, 514 events. 302/514 cut-off events. For 5670/5716 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2118 event pairs, 29 based on Foata normal form. 50/556 useless extension candidates. Maximal degree in co-relation 3738. Up to 256 conditions per place. [2023-11-19 08:04:40,450 INFO L140 encePairwiseOnDemand]: 204/210 looper letters, 91 selfloop transitions, 11 changer transitions 49/163 dead transitions. [2023-11-19 08:04:40,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 163 transitions, 2630 flow [2023-11-19 08:04:40,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:04:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 08:04:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 787 transitions. [2023-11-19 08:04:40,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46845238095238095 [2023-11-19 08:04:40,455 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 787 transitions. [2023-11-19 08:04:40,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 787 transitions. [2023-11-19 08:04:40,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:40,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 787 transitions. [2023-11-19 08:04:40,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:40,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:40,463 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:40,463 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 1051 flow. Second operand 8 states and 787 transitions. [2023-11-19 08:04:40,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 163 transitions, 2630 flow [2023-11-19 08:04:40,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 163 transitions, 2311 flow, removed 89 selfloop flow, removed 10 redundant places. [2023-11-19 08:04:40,484 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 890 flow [2023-11-19 08:04:40,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=890, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2023-11-19 08:04:40,485 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2023-11-19 08:04:40,485 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 890 flow [2023-11-19 08:04:40,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:40,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:40,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:40,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 08:04:40,486 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:40,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash -572838851, now seen corresponding path program 1 times [2023-11-19 08:04:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:40,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981102055] [2023-11-19 08:04:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:41,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981102055] [2023-11-19 08:04:41,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981102055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:41,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:41,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-19 08:04:41,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176165346] [2023-11-19 08:04:41,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:41,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-19 08:04:41,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-19 08:04:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-19 08:04:42,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 210 [2023-11-19 08:04:42,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 890 flow. Second operand has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:42,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 210 [2023-11-19 08:04:42,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:42,518 INFO L124 PetriNetUnfolderBase]: 439/804 cut-off events. [2023-11-19 08:04:42,519 INFO L125 PetriNetUnfolderBase]: For 5418/5463 co-relation queries the response was YES. [2023-11-19 08:04:42,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5218 conditions, 804 events. 439/804 cut-off events. For 5418/5463 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3811 event pairs, 31 based on Foata normal form. 43/844 useless extension candidates. Maximal degree in co-relation 5176. Up to 358 conditions per place. [2023-11-19 08:04:42,527 INFO L140 encePairwiseOnDemand]: 203/210 looper letters, 88 selfloop transitions, 15 changer transitions 27/137 dead transitions. [2023-11-19 08:04:42,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 137 transitions, 1748 flow [2023-11-19 08:04:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:04:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:04:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 693 transitions. [2023-11-19 08:04:42,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2023-11-19 08:04:42,533 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 693 transitions. [2023-11-19 08:04:42,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 693 transitions. [2023-11-19 08:04:42,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:42,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 693 transitions. [2023-11-19 08:04:42,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,541 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,542 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 890 flow. Second operand 7 states and 693 transitions. [2023-11-19 08:04:42,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 137 transitions, 1748 flow [2023-11-19 08:04:42,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 137 transitions, 1634 flow, removed 33 selfloop flow, removed 5 redundant places. [2023-11-19 08:04:42,569 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 885 flow [2023-11-19 08:04:42,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=885, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2023-11-19 08:04:42,570 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 53 predicate places. [2023-11-19 08:04:42,570 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 885 flow [2023-11-19 08:04:42,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:42,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:42,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:42,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 08:04:42,572 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-19 08:04:42,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash -360000577, now seen corresponding path program 2 times [2023-11-19 08:04:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:42,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014713046] [2023-11-19 08:04:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:42,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:42,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:42,772 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:04:42,773 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-19 08:04:42,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-19 08:04:42,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-19 08:04:42,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-19 08:04:42,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-19 08:04:42,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-19 08:04:42,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-19 08:04:42,777 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:42,785 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:04:42,785 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:04:42,863 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 08:04:42,865 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:04:42,867 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:04:42,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:04:42 BasicIcfg [2023-11-19 08:04:42,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:04:42,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:04:42,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:04:42,909 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:04:42,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:16" (3/4) ... [2023-11-19 08:04:42,911 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 08:04:42,947 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 08:04:42,950 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:04:42,954 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 08:04:43,041 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:04:43,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:04:43,042 INFO L158 Benchmark]: Toolchain (without parser) took 28083.93ms. Allocated memory was 125.8MB in the beginning and 557.8MB in the end (delta: 432.0MB). Free memory was 78.9MB in the beginning and 366.1MB in the end (delta: -287.2MB). Peak memory consumption was 147.3MB. Max. memory is 16.1GB. [2023-11-19 08:04:43,042 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 125.8MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:04:43,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.63ms. Allocated memory is still 125.8MB. Free memory was 78.9MB in the beginning and 55.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 08:04:43,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.19ms. Allocated memory is still 125.8MB. Free memory was 55.3MB in the beginning and 52.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:04:43,043 INFO L158 Benchmark]: Boogie Preprocessor took 59.06ms. Allocated memory is still 125.8MB. Free memory was 52.6MB in the beginning and 50.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:04:43,044 INFO L158 Benchmark]: RCFGBuilder took 893.93ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 50.5MB in the beginning and 106.1MB in the end (delta: -55.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2023-11-19 08:04:43,044 INFO L158 Benchmark]: TraceAbstraction took 26219.64ms. Allocated memory was 167.8MB in the beginning and 557.8MB in the end (delta: 390.1MB). Free memory was 105.1MB in the beginning and 375.6MB in the end (delta: -270.4MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2023-11-19 08:04:43,045 INFO L158 Benchmark]: Witness Printer took 132.33ms. Allocated memory is still 557.8MB. Free memory was 375.6MB in the beginning and 366.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 08:04:43,048 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.56ms. Allocated memory is still 125.8MB. Free memory is still 98.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.63ms. Allocated memory is still 125.8MB. Free memory was 78.9MB in the beginning and 55.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.19ms. Allocated memory is still 125.8MB. Free memory was 55.3MB in the beginning and 52.6MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.06ms. Allocated memory is still 125.8MB. Free memory was 52.6MB in the beginning and 50.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 893.93ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 50.5MB in the beginning and 106.1MB in the end (delta: -55.6MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * TraceAbstraction took 26219.64ms. Allocated memory was 167.8MB in the beginning and 557.8MB in the end (delta: 390.1MB). Free memory was 105.1MB in the beginning and 375.6MB in the end (delta: -270.4MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. * Witness Printer took 132.33ms. Allocated memory is still 557.8MB. Free memory was 375.6MB in the beginning and 366.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 115 PlacesBefore, 33 PlacesAfterwards, 108 TransitionsBefore, 23 TransitionsAfterwards, 2218 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 99 TotalNumberOfCompositions, 5217 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2544, independent: 2387, independent conditional: 0, independent unconditional: 2387, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1178, independent: 1136, independent conditional: 0, independent unconditional: 1136, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2544, independent: 1251, independent conditional: 0, independent unconditional: 1251, dependent: 115, dependent conditional: 0, dependent unconditional: 115, unknown: 1178, unknown conditional: 0, unknown unconditional: 1178] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 819]: 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: 823]: 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: 821]: 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, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 26.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 716 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 528 mSDsluCounter, 396 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1724 IncrementalHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 124 mSDtfsCounter, 1724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1601occurred in iteration=13, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 2773 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-19 08:04:43,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02a862be-ddb5-47f3-86eb-2d65c4f37d92/bin/uautomizer-verify-uCwYo4JHxu/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