./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:08:23,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:08:23,928 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:08:23,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:08:23,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:08:23,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:08:23,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:08:23,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:08:23,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:08:23,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:08:23,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:08:23,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:08:23,975 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:08:23,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:08:23,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:08:23,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:08:23,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:08:23,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:08:23,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:08:23,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:08:23,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:08:23,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:08:23,990 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:08:23,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:08:23,991 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:08:23,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:08:23,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:08:23,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:08:23,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:23,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:08:23,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:08:23,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:08:23,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:08:23,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:08:23,998 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:08:23,999 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:08:23,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:08:23,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:08:24,000 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:08:24,000 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_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/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_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 3bc57c42fd552df471a50a3f823d776d12ae5a02a1da1686aaab749af4f270bf [2023-11-06 23:08:24,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:08:24,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:08:24,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:08:24,427 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:08:24,428 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:08:24,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2023-11-06 23:08:27,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:08:28,041 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:08:28,042 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i [2023-11-06 23:08:28,070 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/data/e771e3ec6/156b7208681f46be9989f7fe4bdd134a/FLAGac94d8c42 [2023-11-06 23:08:28,086 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/data/e771e3ec6/156b7208681f46be9989f7fe4bdd134a [2023-11-06 23:08:28,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:08:28,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:08:28,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:28,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:08:28,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:08:28,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:28,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17483815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28, skipping insertion in model container [2023-11-06 23:08:28,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:28,160 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:08:28,348 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_018eab69-75fb-4d4c-9939-6c0339f7ad1e/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i[949,962] [2023-11-06 23:08:28,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:28,667 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:08:28,688 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_018eab69-75fb-4d4c-9939-6c0339f7ad1e/sv-benchmarks/c/pthread-wmm/mix018_tso.oepc.i[949,962] [2023-11-06 23:08:28,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:08:28,858 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:08:28,858 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:08:28,867 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:08:28,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28 WrapperNode [2023-11-06 23:08:28,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:08:28,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:28,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:08:28,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:08:28,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:28,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:28,975 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-11-06 23:08:28,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:08:28,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:08:28,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:08:28,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:08:28,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:28,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:08:29,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:08:29,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:08:29,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:08:29,069 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (1/1) ... [2023-11-06 23:08:29,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:08:29,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:08:29,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:08:29,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:08:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:08:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:08:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:08:29,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:08:29,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:08:29,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:08:29,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:08:29,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:08:29,181 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:08:29,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:08:29,183 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:08:29,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:08:29,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:08:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:08:29,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:08:29,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:08:29,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:08:29,188 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:08:29,442 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:08:29,446 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:08:29,965 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:08:30,171 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:08:30,172 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:08:30,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:30 BoogieIcfgContainer [2023-11-06 23:08:30,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:08:30,178 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:08:30,178 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:08:30,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:08:30,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:08:28" (1/3) ... [2023-11-06 23:08:30,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd5573c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:30, skipping insertion in model container [2023-11-06 23:08:30,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:08:28" (2/3) ... [2023-11-06 23:08:30,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd5573c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:08:30, skipping insertion in model container [2023-11-06 23:08:30,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:30" (3/3) ... [2023-11-06 23:08:30,186 INFO L112 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2023-11-06 23:08:30,197 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:08:30,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:08:30,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 23:08:30,211 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:08:30,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:08:30,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 284 flow [2023-11-06 23:08:30,474 INFO L124 PetriNetUnfolderBase]: 2/130 cut-off events. [2023-11-06 23:08:30,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:30,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-06 23:08:30,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 284 flow [2023-11-06 23:08:30,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2023-11-06 23:08:30,497 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:08:30,509 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2023-11-06 23:08:30,512 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2023-11-06 23:08:30,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2023-11-06 23:08:30,552 INFO L124 PetriNetUnfolderBase]: 2/130 cut-off events. [2023-11-06 23:08:30,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:30,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-11-06 23:08:30,557 INFO L119 LiptonReduction]: Number of co-enabled transitions 3390 [2023-11-06 23:08:38,653 INFO L134 LiptonReduction]: Checked pairs total: 9390 [2023-11-06 23:08:38,653 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-11-06 23:08:38,670 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:08:38,678 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1ea4aac7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:08:38,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 23:08:38,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:08:38,684 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-06 23:08:38,684 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:08:38,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:38,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:08:38,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:38,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 538630181, now seen corresponding path program 1 times [2023-11-06 23:08:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:38,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126417991] [2023-11-06 23:08:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:39,216 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-06 23:08:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126417991] [2023-11-06 23:08:39,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126417991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:39,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:39,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:08:39,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619838366] [2023-11-06 23:08:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:39,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:39,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:39,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:39,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 244 [2023-11-06 23:08:39,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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-06 23:08:39,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:39,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 244 [2023-11-06 23:08:39,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:40,716 INFO L124 PetriNetUnfolderBase]: 3927/5513 cut-off events. [2023-11-06 23:08:40,717 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-06 23:08:40,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11065 conditions, 5513 events. 3927/5513 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 27640 event pairs, 1469 based on Foata normal form. 0/5212 useless extension candidates. Maximal degree in co-relation 11053. Up to 4291 conditions per place. [2023-11-06 23:08:40,773 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-06 23:08:40,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 192 flow [2023-11-06 23:08:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:40,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:08:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-11-06 23:08:40,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409836065573771 [2023-11-06 23:08:40,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-11-06 23:08:40,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-11-06 23:08:40,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:40,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-11-06 23:08:40,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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-06 23:08:40,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:08:40,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:08:40,824 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 396 transitions. [2023-11-06 23:08:40,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 192 flow [2023-11-06 23:08:40,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:08:40,834 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-11-06 23:08:40,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-06 23:08:40,841 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 23:08:40,841 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-11-06 23:08:40,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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-06 23:08:40,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:40,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:40,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:08:40,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:40,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1376271057, now seen corresponding path program 1 times [2023-11-06 23:08:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383783659] [2023-11-06 23:08:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:41,658 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-06 23:08:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:41,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383783659] [2023-11-06 23:08:41,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383783659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:41,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:41,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:41,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589328293] [2023-11-06 23:08:41,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:41,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:41,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:41,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 244 [2023-11-06 23:08:41,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 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-06 23:08:41,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:41,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 244 [2023-11-06 23:08:41,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:43,585 INFO L124 PetriNetUnfolderBase]: 6909/9359 cut-off events. [2023-11-06 23:08:43,585 INFO L125 PetriNetUnfolderBase]: For 485/485 co-relation queries the response was YES. [2023-11-06 23:08:43,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19459 conditions, 9359 events. 6909/9359 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 43355 event pairs, 2349 based on Foata normal form. 200/9558 useless extension candidates. Maximal degree in co-relation 19449. Up to 6461 conditions per place. [2023-11-06 23:08:43,674 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-06 23:08:43,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 176 flow [2023-11-06 23:08:43,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:08:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-11-06 23:08:43,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49453551912568305 [2023-11-06 23:08:43,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-11-06 23:08:43,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-11-06 23:08:43,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:43,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-11-06 23:08:43,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 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-06 23:08:43,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:08:43,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:08:43,691 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 362 transitions. [2023-11-06 23:08:43,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 176 flow [2023-11-06 23:08:43,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:43,697 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2023-11-06 23:08:43,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-11-06 23:08:43,706 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-11-06 23:08:43,707 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2023-11-06 23:08:43,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 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-06 23:08:43,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:43,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:43,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:08:43,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:43,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash 178509268, now seen corresponding path program 1 times [2023-11-06 23:08:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919261063] [2023-11-06 23:08:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:43,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:44,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-06 23:08:44,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:44,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919261063] [2023-11-06 23:08:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919261063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:44,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:44,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:08:44,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845406349] [2023-11-06 23:08:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:44,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:44,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:44,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:44,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:44,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 244 [2023-11-06 23:08:44,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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-06 23:08:44,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:44,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 244 [2023-11-06 23:08:44,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:45,719 INFO L124 PetriNetUnfolderBase]: 3677/5370 cut-off events. [2023-11-06 23:08:45,720 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-11-06 23:08:45,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10879 conditions, 5370 events. 3677/5370 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 29843 event pairs, 785 based on Foata normal form. 24/5353 useless extension candidates. Maximal degree in co-relation 10868. Up to 4759 conditions per place. [2023-11-06 23:08:45,794 INFO L140 encePairwiseOnDemand]: 240/244 looper letters, 38 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-11-06 23:08:45,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 194 flow [2023-11-06 23:08:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:08:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-11-06 23:08:45,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5409836065573771 [2023-11-06 23:08:45,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-11-06 23:08:45,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-11-06 23:08:45,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:45,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-11-06 23:08:45,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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-06 23:08:45,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:08:45,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:08:45,808 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 3 states and 396 transitions. [2023-11-06 23:08:45,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 194 flow [2023-11-06 23:08:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:08:45,813 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 87 flow [2023-11-06 23:08:45,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-11-06 23:08:45,816 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-11-06 23:08:45,821 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 87 flow [2023-11-06 23:08:45,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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-06 23:08:45,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:45,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:45,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:08:45,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:45,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:45,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1238818051, now seen corresponding path program 1 times [2023-11-06 23:08:45,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999908500] [2023-11-06 23:08:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:45,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:46,890 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-06 23:08:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:46,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999908500] [2023-11-06 23:08:46,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999908500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:46,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614556278] [2023-11-06 23:08:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:46,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:46,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:46,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 23:08:46,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 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-06 23:08:46,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:46,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 23:08:46,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:48,018 INFO L124 PetriNetUnfolderBase]: 3661/5152 cut-off events. [2023-11-06 23:08:48,018 INFO L125 PetriNetUnfolderBase]: For 1109/1109 co-relation queries the response was YES. [2023-11-06 23:08:48,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 5152 events. 3661/5152 cut-off events. For 1109/1109 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 24778 event pairs, 1595 based on Foata normal form. 4/5135 useless extension candidates. Maximal degree in co-relation 11600. Up to 4853 conditions per place. [2023-11-06 23:08:48,077 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 45 selfloop transitions, 9 changer transitions 0/58 dead transitions. [2023-11-06 23:08:48,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 269 flow [2023-11-06 23:08:48,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-11-06 23:08:48,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215163934426229 [2023-11-06 23:08:48,081 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-11-06 23:08:48,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-11-06 23:08:48,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:48,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-11-06 23:08:48,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:08:48,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:08:48,088 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:08:48,088 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 87 flow. Second operand 4 states and 509 transitions. [2023-11-06 23:08:48,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 269 flow [2023-11-06 23:08:48,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:48,092 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 148 flow [2023-11-06 23:08:48,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-06 23:08:48,094 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-11-06 23:08:48,095 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 148 flow [2023-11-06 23:08:48,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 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-06 23:08:48,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:48,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:48,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:08:48,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:48,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:48,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1932103788, now seen corresponding path program 1 times [2023-11-06 23:08:48,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827002019] [2023-11-06 23:08:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:48,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:48,759 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-06 23:08:48,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:48,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827002019] [2023-11-06 23:08:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827002019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:48,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458982664] [2023-11-06 23:08:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:48,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:48,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 23:08:48,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-06 23:08:48,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:48,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 23:08:48,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:50,916 INFO L124 PetriNetUnfolderBase]: 9349/12630 cut-off events. [2023-11-06 23:08:50,916 INFO L125 PetriNetUnfolderBase]: For 6316/6316 co-relation queries the response was YES. [2023-11-06 23:08:50,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31744 conditions, 12630 events. 9349/12630 cut-off events. For 6316/6316 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 58524 event pairs, 3140 based on Foata normal form. 80/12710 useless extension candidates. Maximal degree in co-relation 31729. Up to 10077 conditions per place. [2023-11-06 23:08:51,035 INFO L140 encePairwiseOnDemand]: 233/244 looper letters, 78 selfloop transitions, 17 changer transitions 0/95 dead transitions. [2023-11-06 23:08:51,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 95 transitions, 500 flow [2023-11-06 23:08:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-11-06 23:08:51,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016393442622951 [2023-11-06 23:08:51,040 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-11-06 23:08:51,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-11-06 23:08:51,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:51,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-11-06 23:08:51,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 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-06 23:08:51,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 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-06 23:08:51,049 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 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-06 23:08:51,049 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 148 flow. Second operand 5 states and 612 transitions. [2023-11-06 23:08:51,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 95 transitions, 500 flow [2023-11-06 23:08:51,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 95 transitions, 498 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 23:08:51,062 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 259 flow [2023-11-06 23:08:51,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-11-06 23:08:51,066 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places. [2023-11-06 23:08:51,066 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 259 flow [2023-11-06 23:08:51,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 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-06 23:08:51,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:51,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:51,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:08:51,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:51,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1934208378, now seen corresponding path program 2 times [2023-11-06 23:08:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238785294] [2023-11-06 23:08:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:51,839 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-06 23:08:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:51,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238785294] [2023-11-06 23:08:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238785294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:51,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:51,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108540536] [2023-11-06 23:08:51,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:51,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:08:51,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:51,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:08:51,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:08:51,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 23:08:51,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 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-06 23:08:51,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:51,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 23:08:51,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:53,334 INFO L124 PetriNetUnfolderBase]: 5230/7526 cut-off events. [2023-11-06 23:08:53,334 INFO L125 PetriNetUnfolderBase]: For 12781/13454 co-relation queries the response was YES. [2023-11-06 23:08:53,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23273 conditions, 7526 events. 5230/7526 cut-off events. For 12781/13454 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 40575 event pairs, 1808 based on Foata normal form. 156/7459 useless extension candidates. Maximal degree in co-relation 23254. Up to 5396 conditions per place. [2023-11-06 23:08:53,418 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 54 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2023-11-06 23:08:53,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 469 flow [2023-11-06 23:08:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-11-06 23:08:53,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297131147540983 [2023-11-06 23:08:53,422 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-11-06 23:08:53,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-11-06 23:08:53,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:53,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-11-06 23:08:53,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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-06 23:08:53,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:08:53,429 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:08:53,430 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 259 flow. Second operand 4 states and 517 transitions. [2023-11-06 23:08:53,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 469 flow [2023-11-06 23:08:53,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 456 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:53,451 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 289 flow [2023-11-06 23:08:53,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=289, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-11-06 23:08:53,455 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-11-06 23:08:53,455 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 289 flow [2023-11-06 23:08:53,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 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-06 23:08:53,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:53,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:53,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:08:53,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:53,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:53,457 INFO L85 PathProgramCache]: Analyzing trace with hash 167610135, now seen corresponding path program 1 times [2023-11-06 23:08:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:53,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140496483] [2023-11-06 23:08:53,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:53,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:54,230 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-06 23:08:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:54,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140496483] [2023-11-06 23:08:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140496483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:08:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806317835] [2023-11-06 23:08:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:54,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:08:54,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:08:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:08:54,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 23:08:54,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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-06 23:08:54,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:54,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 23:08:54,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:55,687 INFO L124 PetriNetUnfolderBase]: 5935/8721 cut-off events. [2023-11-06 23:08:55,687 INFO L125 PetriNetUnfolderBase]: For 18393/19394 co-relation queries the response was YES. [2023-11-06 23:08:55,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27487 conditions, 8721 events. 5935/8721 cut-off events. For 18393/19394 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 50485 event pairs, 1625 based on Foata normal form. 262/8771 useless extension candidates. Maximal degree in co-relation 27466. Up to 4922 conditions per place. [2023-11-06 23:08:55,765 INFO L140 encePairwiseOnDemand]: 236/244 looper letters, 65 selfloop transitions, 25 changer transitions 0/97 dead transitions. [2023-11-06 23:08:55,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 97 transitions, 632 flow [2023-11-06 23:08:55,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:08:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:08:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-11-06 23:08:55,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5278688524590164 [2023-11-06 23:08:55,770 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-11-06 23:08:55,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-11-06 23:08:55,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:55,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-11-06 23:08:55,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 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-06 23:08:55,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 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-06 23:08:55,778 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 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-06 23:08:55,778 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 289 flow. Second operand 5 states and 644 transitions. [2023-11-06 23:08:55,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 97 transitions, 632 flow [2023-11-06 23:08:55,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 600 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:08:55,815 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 403 flow [2023-11-06 23:08:55,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2023-11-06 23:08:55,816 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-11-06 23:08:55,816 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 403 flow [2023-11-06 23:08:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 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-06 23:08:55,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:55,817 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-06 23:08:55,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:08:55,818 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:55,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:55,819 INFO L85 PathProgramCache]: Analyzing trace with hash -722537093, now seen corresponding path program 1 times [2023-11-06 23:08:55,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:55,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9157934] [2023-11-06 23:08:55,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:56,048 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-06 23:08:56,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9157934] [2023-11-06 23:08:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9157934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:56,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:56,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:08:56,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885561381] [2023-11-06 23:08:56,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:56,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:08:56,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:56,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:08:56,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:08:56,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 23:08:56,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 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-06 23:08:56,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:56,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 23:08:56,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:58,021 INFO L124 PetriNetUnfolderBase]: 10008/14374 cut-off events. [2023-11-06 23:08:58,022 INFO L125 PetriNetUnfolderBase]: For 40817/41411 co-relation queries the response was YES. [2023-11-06 23:08:58,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50995 conditions, 14374 events. 10008/14374 cut-off events. For 40817/41411 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 85457 event pairs, 2197 based on Foata normal form. 300/14501 useless extension candidates. Maximal degree in co-relation 50972. Up to 7577 conditions per place. [2023-11-06 23:08:58,136 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 96 selfloop transitions, 2 changer transitions 13/121 dead transitions. [2023-11-06 23:08:58,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 121 transitions, 1052 flow [2023-11-06 23:08:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:08:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:08:58,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-11-06 23:08:58,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286885245901639 [2023-11-06 23:08:58,140 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-11-06 23:08:58,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-11-06 23:08:58,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:58,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-11-06 23:08:58,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 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-06 23:08:58,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:08:58,146 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:08:58,146 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 403 flow. Second operand 4 states and 516 transitions. [2023-11-06 23:08:58,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 121 transitions, 1052 flow [2023-11-06 23:08:58,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 121 transitions, 1015 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-06 23:08:58,298 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 397 flow [2023-11-06 23:08:58,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-11-06 23:08:58,300 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-11-06 23:08:58,301 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 397 flow [2023-11-06 23:08:58,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 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-06 23:08:58,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:08:58,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:08:58,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:08:58,302 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:08:58,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:08:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash -627863496, now seen corresponding path program 1 times [2023-11-06 23:08:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:08:58,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165097789] [2023-11-06 23:08:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:08:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:08:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:08:58,524 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-06 23:08:58,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:08:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165097789] [2023-11-06 23:08:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165097789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:08:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:08:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:08:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634030503] [2023-11-06 23:08:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:08:58,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:08:58,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:08:58,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:08:58,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:08:58,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 23:08:58,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-06 23:08:58,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:08:58,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 23:08:58,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:08:59,294 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][76], [Black: 160#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0)), 26#L836true, 210#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 165#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 102#P0EXITtrue, Black: 167#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork0InUse, Black: 197#(and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), 95#L806true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 214#true, 106#L871true, P3Thread1of1ForFork2InUse, Black: 177#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0)), Black: 174#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 207#(= ~a~0 1), 22#L783true, Black: 154#(= ~__unbuffered_p3_EAX~0 0), 163#true, Black: 187#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (or (= ~x~0 0) (= ~x~0 1)))]) [2023-11-06 23:08:59,295 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:08:59,295 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:08:59,295 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:08:59,295 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:08:59,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][72], [111#L793true, Black: 160#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0)), 26#L836true, 210#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 165#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 102#P0EXITtrue, Black: 167#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 197#(and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), P2Thread1of1ForFork0InUse, 95#L806true, P1Thread1of1ForFork3InUse, 214#true, P0Thread1of1ForFork1InUse, 106#L871true, P3Thread1of1ForFork2InUse, Black: 177#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0)), Black: 174#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 207#(= ~a~0 1), Black: 154#(= ~__unbuffered_p3_EAX~0 0), 163#true, Black: 187#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (or (= ~x~0 0) (= ~x~0 1)))]) [2023-11-06 23:08:59,644 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:08:59,644 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:08:59,644 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:08:59,644 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:08:59,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L836: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_145 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_146 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff0_thd4~0_25 (ite .cse1 0 v_~x$r_buff0_thd4~0_26)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse4 0 v_~x$w_buff0_used~0_146) v_~x$w_buff0_used~0_145) (= v_~x~0_79 (ite .cse4 v_~x$w_buff0~0_64 (ite .cse0 v_~x$w_buff1~0_59 v_~x~0_80)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_80, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_146} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_79, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_145} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][72], [Black: 160#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0)), 26#L836true, 210#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 165#(and (= ~x~0 0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), 102#P0EXITtrue, Black: 167#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x~0 ~x$w_buff1~0)), Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 108#P1EXITtrue, P2Thread1of1ForFork0InUse, Black: 197#(and (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (= ~x$w_buff0_used~0 1) (or (= ~x~0 0) (= ~x~0 1)) (= 0 ~x$r_buff0_thd0~0)), 95#L806true, P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, 214#true, 106#L871true, P3Thread1of1ForFork2InUse, Black: 177#(and (= 0 ~x$w_buff1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0)))) (= 0 ~x$w_buff0~0)), Black: 174#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1)), Black: 207#(= ~a~0 1), Black: 154#(= ~__unbuffered_p3_EAX~0 0), 163#true, Black: 187#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x$w_buff0_used~0 0) (or (= ~x~0 0) (= ~x~0 1)))]) [2023-11-06 23:08:59,754 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:08:59,754 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:08:59,754 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:08:59,754 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:08:59,900 INFO L124 PetriNetUnfolderBase]: 5839/8785 cut-off events. [2023-11-06 23:08:59,900 INFO L125 PetriNetUnfolderBase]: For 28467/28992 co-relation queries the response was YES. [2023-11-06 23:08:59,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32011 conditions, 8785 events. 5839/8785 cut-off events. For 28467/28992 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 52760 event pairs, 1549 based on Foata normal form. 451/9075 useless extension candidates. Maximal degree in co-relation 31986. Up to 7321 conditions per place. [2023-11-06 23:08:59,988 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 69 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2023-11-06 23:08:59,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 710 flow [2023-11-06 23:08:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:08:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:08:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-11-06 23:08:59,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245901639344263 [2023-11-06 23:08:59,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-11-06 23:08:59,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-11-06 23:08:59,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:08:59,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-11-06 23:09:00,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-06 23:09:00,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:09:00,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 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-06 23:09:00,005 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 397 flow. Second operand 3 states and 384 transitions. [2023-11-06 23:09:00,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 710 flow [2023-11-06 23:09:00,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:09:00,056 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 429 flow [2023-11-06 23:09:00,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-11-06 23:09:00,057 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2023-11-06 23:09:00,057 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 429 flow [2023-11-06 23:09:00,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-06 23:09:00,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:00,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:00,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:09:00,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:09:00,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash -997001607, now seen corresponding path program 1 times [2023-11-06 23:09:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060581981] [2023-11-06 23:09:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:00,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:00,323 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-06 23:09:00,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:00,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060581981] [2023-11-06 23:09:00,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060581981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:00,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:00,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:09:00,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928302113] [2023-11-06 23:09:00,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:00,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:09:00,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:00,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:09:00,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:09:00,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 23:09:00,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 429 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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-06 23:09:00,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:00,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 23:09:00,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:01,571 INFO L124 PetriNetUnfolderBase]: 3101/4985 cut-off events. [2023-11-06 23:09:01,571 INFO L125 PetriNetUnfolderBase]: For 16017/16285 co-relation queries the response was YES. [2023-11-06 23:09:01,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19995 conditions, 4985 events. 3101/4985 cut-off events. For 16017/16285 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 29804 event pairs, 487 based on Foata normal form. 511/5431 useless extension candidates. Maximal degree in co-relation 19968. Up to 2131 conditions per place. [2023-11-06 23:09:01,617 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 86 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2023-11-06 23:09:01,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 107 transitions, 899 flow [2023-11-06 23:09:01,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:09:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:09:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-06 23:09:01,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266393442622951 [2023-11-06 23:09:01,621 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-06 23:09:01,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-06 23:09:01,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:01,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-06 23:09:01,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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-06 23:09:01,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:09:01,628 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:09:01,628 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 429 flow. Second operand 4 states and 514 transitions. [2023-11-06 23:09:01,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 107 transitions, 899 flow [2023-11-06 23:09:01,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 107 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:09:01,663 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 454 flow [2023-11-06 23:09:01,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2023-11-06 23:09:01,664 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-11-06 23:09:01,664 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 454 flow [2023-11-06 23:09:01,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 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-06 23:09:01,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:01,665 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-06 23:09:01,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:09:01,666 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:09:01,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:01,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1268006112, now seen corresponding path program 1 times [2023-11-06 23:09:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:01,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143222826] [2023-11-06 23:09:01,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:01,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:01,948 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-06 23:09:01,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:01,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143222826] [2023-11-06 23:09:01,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143222826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:01,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:01,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:09:01,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723960114] [2023-11-06 23:09:01,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:01,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:09:01,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:09:01,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:09:01,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 23:09:01,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 454 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 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-06 23:09:01,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:01,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 23:09:01,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:02,739 INFO L124 PetriNetUnfolderBase]: 2338/3773 cut-off events. [2023-11-06 23:09:02,740 INFO L125 PetriNetUnfolderBase]: For 13783/14000 co-relation queries the response was YES. [2023-11-06 23:09:02,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16071 conditions, 3773 events. 2338/3773 cut-off events. For 13783/14000 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22003 event pairs, 395 based on Foata normal form. 264/3983 useless extension candidates. Maximal degree in co-relation 16042. Up to 1490 conditions per place. [2023-11-06 23:09:02,781 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 95 selfloop transitions, 13 changer transitions 0/120 dead transitions. [2023-11-06 23:09:02,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 1030 flow [2023-11-06 23:09:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:09:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:09:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 642 transitions. [2023-11-06 23:09:02,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5262295081967213 [2023-11-06 23:09:02,786 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 642 transitions. [2023-11-06 23:09:02,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 642 transitions. [2023-11-06 23:09:02,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:02,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 642 transitions. [2023-11-06 23:09:02,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 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-06 23:09:02,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 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-06 23:09:02,794 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 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-06 23:09:02,795 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 454 flow. Second operand 5 states and 642 transitions. [2023-11-06 23:09:02,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 1030 flow [2023-11-06 23:09:02,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 120 transitions, 938 flow, removed 16 selfloop flow, removed 5 redundant places. [2023-11-06 23:09:02,830 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 449 flow [2023-11-06 23:09:02,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=449, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2023-11-06 23:09:02,831 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-11-06 23:09:02,831 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 449 flow [2023-11-06 23:09:02,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 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-06 23:09:02,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:02,832 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, 1, 1, 1] [2023-11-06 23:09:02,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:09:02,833 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:09:02,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2061047789, now seen corresponding path program 1 times [2023-11-06 23:09:02,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:02,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567070911] [2023-11-06 23:09:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:03,174 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-06 23:09:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567070911] [2023-11-06 23:09:03,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567070911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:03,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:09:03,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067018194] [2023-11-06 23:09:03,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:03,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:09:03,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:03,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:09:03,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:09:03,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-11-06 23:09:03,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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-06 23:09:03,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:03,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-11-06 23:09:03,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:03,971 INFO L124 PetriNetUnfolderBase]: 2270/3625 cut-off events. [2023-11-06 23:09:03,971 INFO L125 PetriNetUnfolderBase]: For 10490/10671 co-relation queries the response was YES. [2023-11-06 23:09:03,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14930 conditions, 3625 events. 2270/3625 cut-off events. For 10490/10671 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 20951 event pairs, 400 based on Foata normal form. 85/3657 useless extension candidates. Maximal degree in co-relation 14902. Up to 1490 conditions per place. [2023-11-06 23:09:04,010 INFO L140 encePairwiseOnDemand]: 238/244 looper letters, 84 selfloop transitions, 17 changer transitions 9/120 dead transitions. [2023-11-06 23:09:04,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 120 transitions, 982 flow [2023-11-06 23:09:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:09:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:09:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2023-11-06 23:09:04,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163934426229508 [2023-11-06 23:09:04,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 756 transitions. [2023-11-06 23:09:04,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 756 transitions. [2023-11-06 23:09:04,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:04,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 756 transitions. [2023-11-06 23:09:04,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 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-06 23:09:04,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 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-06 23:09:04,027 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 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-06 23:09:04,027 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 449 flow. Second operand 6 states and 756 transitions. [2023-11-06 23:09:04,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 120 transitions, 982 flow [2023-11-06 23:09:04,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 120 transitions, 887 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-11-06 23:09:04,131 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 403 flow [2023-11-06 23:09:04,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-11-06 23:09:04,133 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-11-06 23:09:04,133 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 403 flow [2023-11-06 23:09:04,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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-06 23:09:04,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:04,134 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:04,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:09:04,134 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:09:04,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2132241457, now seen corresponding path program 1 times [2023-11-06 23:09:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:04,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643069627] [2023-11-06 23:09:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:04,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:04,700 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-06 23:09:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643069627] [2023-11-06 23:09:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643069627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:04,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:04,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:09:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518011663] [2023-11-06 23:09:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:04,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:09:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:09:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:09:04,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-11-06 23:09:04,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 403 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-06 23:09:04,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:04,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-11-06 23:09:04,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:05,662 INFO L124 PetriNetUnfolderBase]: 3566/5363 cut-off events. [2023-11-06 23:09:05,662 INFO L125 PetriNetUnfolderBase]: For 11955/11995 co-relation queries the response was YES. [2023-11-06 23:09:05,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20628 conditions, 5363 events. 3566/5363 cut-off events. For 11955/11995 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 29001 event pairs, 248 based on Foata normal form. 26/5346 useless extension candidates. Maximal degree in co-relation 20609. Up to 2753 conditions per place. [2023-11-06 23:09:05,703 INFO L140 encePairwiseOnDemand]: 237/244 looper letters, 92 selfloop transitions, 9 changer transitions 39/144 dead transitions. [2023-11-06 23:09:05,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 144 transitions, 1181 flow [2023-11-06 23:09:05,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:09:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:09:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2023-11-06 23:09:05,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48155737704918034 [2023-11-06 23:09:05,709 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 705 transitions. [2023-11-06 23:09:05,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 705 transitions. [2023-11-06 23:09:05,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:05,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 705 transitions. [2023-11-06 23:09:05,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.5) internal successors, (705), 6 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-06 23:09:05,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 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-06 23:09:05,717 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 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-06 23:09:05,717 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 403 flow. Second operand 6 states and 705 transitions. [2023-11-06 23:09:05,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 144 transitions, 1181 flow [2023-11-06 23:09:05,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 144 transitions, 1066 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-11-06 23:09:05,803 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 382 flow [2023-11-06 23:09:05,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2023-11-06 23:09:05,804 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-11-06 23:09:05,804 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 382 flow [2023-11-06 23:09:05,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 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-06 23:09:05,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:05,805 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:05,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:09:05,805 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:09:05,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:05,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1718492971, now seen corresponding path program 2 times [2023-11-06 23:09:05,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:05,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917846681] [2023-11-06 23:09:05,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:05,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:09:06,050 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-06 23:09:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:09:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917846681] [2023-11-06 23:09:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917846681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:09:06,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:09:06,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:09:06,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385526414] [2023-11-06 23:09:06,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:09:06,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:09:06,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:09:06,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:09:06,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:09:06,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-11-06 23:09:06,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 382 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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-06 23:09:06,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:09:06,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-11-06 23:09:06,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:09:06,829 INFO L124 PetriNetUnfolderBase]: 3157/5174 cut-off events. [2023-11-06 23:09:06,829 INFO L125 PetriNetUnfolderBase]: For 10573/10589 co-relation queries the response was YES. [2023-11-06 23:09:06,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19610 conditions, 5174 events. 3157/5174 cut-off events. For 10573/10589 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32348 event pairs, 990 based on Foata normal form. 11/5114 useless extension candidates. Maximal degree in co-relation 19582. Up to 1888 conditions per place. [2023-11-06 23:09:06,849 INFO L140 encePairwiseOnDemand]: 241/244 looper letters, 50 selfloop transitions, 1 changer transitions 72/128 dead transitions. [2023-11-06 23:09:06,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 128 transitions, 1033 flow [2023-11-06 23:09:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:09:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:09:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2023-11-06 23:09:06,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194672131147541 [2023-11-06 23:09:06,852 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 507 transitions. [2023-11-06 23:09:06,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 507 transitions. [2023-11-06 23:09:06,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:09:06,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 507 transitions. [2023-11-06 23:09:06,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.75) internal successors, (507), 4 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-06 23:09:06,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:09:06,859 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 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-06 23:09:06,859 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 382 flow. Second operand 4 states and 507 transitions. [2023-11-06 23:09:06,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 128 transitions, 1033 flow [2023-11-06 23:09:06,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 128 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:09:06,964 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 269 flow [2023-11-06 23:09:06,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2023-11-06 23:09:06,966 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2023-11-06 23:09:06,966 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 269 flow [2023-11-06 23:09:06,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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-06 23:09:06,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:09:06,967 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, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:06,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:09:06,967 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 23:09:06,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:09:06,968 INFO L85 PathProgramCache]: Analyzing trace with hash -304766975, now seen corresponding path program 3 times [2023-11-06 23:09:06,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:09:06,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587070951] [2023-11-06 23:09:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:09:06,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:09:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:09:07,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:09:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:09:07,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:09:07,152 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:09:07,154 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 23:09:07,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 23:09:07,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 23:09:07,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 23:09:07,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 23:09:07,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 23:09:07,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 23:09:07,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:09:07,159 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:09:07,167 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:09:07,167 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:09:07,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:09:07 BasicIcfg [2023-11-06 23:09:07,293 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:09:07,294 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:09:07,294 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:09:07,294 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:09:07,295 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:08:30" (3/4) ... [2023-11-06 23:09:07,296 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:09:07,468 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:09:07,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:09:07,469 INFO L158 Benchmark]: Toolchain (without parser) took 39378.35ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 114.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 289.5MB. Max. memory is 16.1GB. [2023-11-06 23:09:07,469 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 117.4MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:09:07,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.34ms. Allocated memory is still 161.5MB. Free memory was 114.3MB in the beginning and 90.0MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 23:09:07,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.08ms. Allocated memory is still 161.5MB. Free memory was 90.0MB in the beginning and 87.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:09:07,477 INFO L158 Benchmark]: Boogie Preprocessor took 82.20ms. Allocated memory is still 161.5MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:09:07,477 INFO L158 Benchmark]: RCFGBuilder took 1108.18ms. Allocated memory is still 161.5MB. Free memory was 85.2MB in the beginning and 98.7MB in the end (delta: -13.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-11-06 23:09:07,478 INFO L158 Benchmark]: TraceAbstraction took 37115.43ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 98.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 255.9MB. Max. memory is 16.1GB. [2023-11-06 23:09:07,478 INFO L158 Benchmark]: Witness Printer took 174.67ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:09:07,482 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.36ms. Allocated memory is still 117.4MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.34ms. Allocated memory is still 161.5MB. Free memory was 114.3MB in the beginning and 90.0MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.08ms. Allocated memory is still 161.5MB. Free memory was 90.0MB in the beginning and 87.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.20ms. Allocated memory is still 161.5MB. Free memory was 87.3MB in the beginning and 85.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1108.18ms. Allocated memory is still 161.5MB. Free memory was 85.2MB in the beginning and 98.7MB in the end (delta: -13.5MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 37115.43ms. Allocated memory was 161.5MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 98.7MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 255.9MB. Max. memory is 16.1GB. * Witness Printer took 174.67ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1s, 141 PlacesBefore, 43 PlacesAfterwards, 130 TransitionsBefore, 30 TransitionsAfterwards, 3390 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 110 TotalNumberOfCompositions, 9390 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3707, independent: 3458, independent conditional: 0, independent unconditional: 3458, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1825, independent: 1781, independent conditional: 0, independent unconditional: 1781, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3707, independent: 1677, independent conditional: 0, independent unconditional: 1677, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1825, unknown conditional: 0, unknown unconditional: 1825] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L853] 0 pthread_t t489; [L854] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t489, ((void *)0), P0, ((void *)0))=-4, t489={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t490; [L856] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t490, ((void *)0), P1, ((void *)0))=-3, t489={5:0}, t490={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L857] 0 pthread_t t491; [L858] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t491, ((void *)0), P2, ((void *)0))=-2, t489={5:0}, t490={6:0}, t491={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L859] 0 pthread_t t492; [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L860] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t492, ((void *)0), P3, ((void *)0))=-1, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L831] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L832] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L833] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L834] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L835] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L867] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L868] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L869] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L870] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t489={5:0}, t490={6:0}, t491={7:0}, t492={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 x$flush_delayed = weak$$choice2 [L876] 0 x$mem_tmp = x [L877] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L878] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L879] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L880] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L881] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L883] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L885] 0 x = x$flush_delayed ? x$mem_tmp : x [L886] 0 x$flush_delayed = (_Bool)0 [L888] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: 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: 854]: 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: 860]: 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 9 procedures, 171 locations, 7 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: 36.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 567 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1460 IncrementalHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 130 mSDtfsCounter, 1460 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=454occurred in iteration=10, InterpolantAutomatonStates: 59, 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.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 1595 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 23:09:07,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_018eab69-75fb-4d4c-9939-6c0339f7ad1e/bin/uautomizer-verify-WvqO1wxjHP/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