./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/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_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/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_a517dce7-4394-4c73-ae65-f755559085c1/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 c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:12:19,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:12:19,202 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:12:19,207 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:12:19,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:12:19,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:12:19,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:12:19,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:12:19,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:12:19,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:12:19,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:12:19,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:12:19,243 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:12:19,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:12:19,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:12:19,245 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:12:19,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:12:19,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:12:19,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:12:19,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:12:19,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:12:19,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:12:19,249 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:12:19,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:12:19,250 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:12:19,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:12:19,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:12:19,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:12:19,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:12:19,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:12:19,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:12:19,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:12:19,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:12:19,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:12:19,256 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:12:19,257 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:12:19,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:12:19,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:12:19,258 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:12:19,259 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_a517dce7-4394-4c73-ae65-f755559085c1/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_a517dce7-4394-4c73-ae65-f755559085c1/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 -> c2150e0b957073117139b89f4d79d7a8523050efb20e53a1bf0b405c120dd6a7 [2023-11-06 23:12:19,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:12:19,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:12:19,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:12:19,672 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:12:19,673 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:12:19,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-11-06 23:12:23,056 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:12:23,343 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:12:23,344 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2023-11-06 23:12:23,364 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/data/58e8ec457/bddfe3d808014de289e7160398cf5ec5/FLAGaad4693b6 [2023-11-06 23:12:23,385 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/data/58e8ec457/bddfe3d808014de289e7160398cf5ec5 [2023-11-06 23:12:23,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:12:23,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:12:23,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:12:23,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:12:23,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:12:23,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c98df55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23, skipping insertion in model container [2023-11-06 23:12:23,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,457 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:12:23,743 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_a517dce7-4394-4c73-ae65-f755559085c1/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2023-11-06 23:12:23,770 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:12:23,784 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:12:23,822 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_a517dce7-4394-4c73-ae65-f755559085c1/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c[4174,4187] [2023-11-06 23:12:23,828 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:12:23,838 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:12:23,839 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:12:23,847 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:12:23,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23 WrapperNode [2023-11-06 23:12:23,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:12:23,850 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:12:23,850 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:12:23,850 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:12:23,859 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:12:23" (1/1) ... [2023-11-06 23:12:23,873 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:12:23" (1/1) ... [2023-11-06 23:12:23,925 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 327 [2023-11-06 23:12:23,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:12:23,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:12:23,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:12:23,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:12:23,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:12:23,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:12:23,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:12:23,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:12:23,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (1/1) ... [2023-11-06 23:12:23,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:12:24,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:12:24,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/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:12:24,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/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:12:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:12:24,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:12:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:12:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:12:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 23:12:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 23:12:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 23:12:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 23:12:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 23:12:24,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 23:12:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-06 23:12:24,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-06 23:12:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:12:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:12:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:12:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:12:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:12:24,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:12:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:12:24,127 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:12:24,375 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:12:24,378 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:12:24,929 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:12:25,164 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:12:25,164 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 23:12:25,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:12:25 BoogieIcfgContainer [2023-11-06 23:12:25,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:12:25,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:12:25,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:12:25,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:12:25,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:12:23" (1/3) ... [2023-11-06 23:12:25,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac908d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:12:25, skipping insertion in model container [2023-11-06 23:12:25,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:12:23" (2/3) ... [2023-11-06 23:12:25,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ac908d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:12:25, skipping insertion in model container [2023-11-06 23:12:25,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:12:25" (3/3) ... [2023-11-06 23:12:25,184 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2023-11-06 23:12:25,194 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 23:12:25,206 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:12:25,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:12:25,206 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:12:25,333 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-06 23:12:25,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 254 transitions, 536 flow [2023-11-06 23:12:25,579 INFO L124 PetriNetUnfolderBase]: 19/250 cut-off events. [2023-11-06 23:12:25,580 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 23:12:25,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 250 events. 19/250 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 114 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 211. Up to 2 conditions per place. [2023-11-06 23:12:25,586 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 254 transitions, 536 flow [2023-11-06 23:12:25,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 237 transitions, 498 flow [2023-11-06 23:12:25,601 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:12:25,621 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 237 transitions, 498 flow [2023-11-06 23:12:25,624 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 237 transitions, 498 flow [2023-11-06 23:12:25,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 237 transitions, 498 flow [2023-11-06 23:12:25,692 INFO L124 PetriNetUnfolderBase]: 19/237 cut-off events. [2023-11-06 23:12:25,692 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 23:12:25,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 237 events. 19/237 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 211. Up to 2 conditions per place. [2023-11-06 23:12:25,697 INFO L119 LiptonReduction]: Number of co-enabled transitions 1824 [2023-11-06 23:12:38,062 INFO L134 LiptonReduction]: Checked pairs total: 3053 [2023-11-06 23:12:38,063 INFO L136 LiptonReduction]: Total number of compositions: 248 [2023-11-06 23:12:38,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:12:38,084 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;@24cd0804, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:12:38,084 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-06 23:12:38,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:12:38,097 INFO L124 PetriNetUnfolderBase]: 6/34 cut-off events. [2023-11-06 23:12:38,097 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 23:12:38,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:38,098 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] [2023-11-06 23:12:38,099 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:12:38,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:38,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1984689939, now seen corresponding path program 1 times [2023-11-06 23:12:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454828343] [2023-11-06 23:12:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:39,118 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:12:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454828343] [2023-11-06 23:12:39,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454828343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:39,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:39,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:12:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972322453] [2023-11-06 23:12:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:39,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:12:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:39,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:12:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:12:39,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 502 [2023-11-06 23:12:39,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 226.8) internal successors, (1134), 5 states have internal predecessors, (1134), 0 states have call successors, (0), 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:12:39,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:39,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 502 [2023-11-06 23:12:39,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:39,836 INFO L124 PetriNetUnfolderBase]: 1500/1945 cut-off events. [2023-11-06 23:12:39,837 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-11-06 23:12:39,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3987 conditions, 1945 events. 1500/1945 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7136 event pairs, 173 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 3750. Up to 1243 conditions per place. [2023-11-06 23:12:39,865 INFO L140 encePairwiseOnDemand]: 497/502 looper letters, 53 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-11-06 23:12:39,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 62 transitions, 280 flow [2023-11-06 23:12:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:12:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:12:39,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1168 transitions. [2023-11-06 23:12:39,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653386454183267 [2023-11-06 23:12:39,900 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1168 transitions. [2023-11-06 23:12:39,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1168 transitions. [2023-11-06 23:12:39,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:39,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1168 transitions. [2023-11-06 23:12:39,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.6) internal successors, (1168), 5 states have internal predecessors, (1168), 0 states have call successors, (0), 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:12:39,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 502.0) internal successors, (3012), 6 states have internal predecessors, (3012), 0 states have call successors, (0), 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:12:39,940 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 502.0) internal successors, (3012), 6 states have internal predecessors, (3012), 0 states have call successors, (0), 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:12:39,942 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 94 flow. Second operand 5 states and 1168 transitions. [2023-11-06 23:12:39,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 62 transitions, 280 flow [2023-11-06 23:12:39,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 252 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-06 23:12:39,958 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 94 flow [2023-11-06 23:12:39,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=94, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2023-11-06 23:12:39,967 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-06 23:12:39,967 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 94 flow [2023-11-06 23:12:39,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 226.8) internal successors, (1134), 5 states have internal predecessors, (1134), 0 states have call successors, (0), 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:12:39,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:39,969 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:12:39,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:12:39,971 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:12:39,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash 62493393, now seen corresponding path program 1 times [2023-11-06 23:12:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071321919] [2023-11-06 23:12:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:39,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071321919] [2023-11-06 23:12:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071321919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:12:40,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245590805] [2023-11-06 23:12:40,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:40,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:12:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:12:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:12:40,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 502 [2023-11-06 23:12:40,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 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:12:40,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:40,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 502 [2023-11-06 23:12:40,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:40,764 INFO L124 PetriNetUnfolderBase]: 1036/1466 cut-off events. [2023-11-06 23:12:40,764 INFO L125 PetriNetUnfolderBase]: For 211/342 co-relation queries the response was YES. [2023-11-06 23:12:40,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 1466 events. 1036/1466 cut-off events. For 211/342 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6106 event pairs, 686 based on Foata normal form. 185/1151 useless extension candidates. Maximal degree in co-relation 2011. Up to 1213 conditions per place. [2023-11-06 23:12:40,783 INFO L140 encePairwiseOnDemand]: 495/502 looper letters, 29 selfloop transitions, 2 changer transitions 18/55 dead transitions. [2023-11-06 23:12:40,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 238 flow [2023-11-06 23:12:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:12:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:12:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1120 transitions. [2023-11-06 23:12:40,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44621513944223107 [2023-11-06 23:12:40,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1120 transitions. [2023-11-06 23:12:40,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1120 transitions. [2023-11-06 23:12:40,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:40,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1120 transitions. [2023-11-06 23:12:40,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 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:12:40,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 502.0) internal successors, (3012), 6 states have internal predecessors, (3012), 0 states have call successors, (0), 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:12:40,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 502.0) internal successors, (3012), 6 states have internal predecessors, (3012), 0 states have call successors, (0), 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:12:40,808 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 94 flow. Second operand 5 states and 1120 transitions. [2023-11-06 23:12:40,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 238 flow [2023-11-06 23:12:40,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 226 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 23:12:40,811 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 106 flow [2023-11-06 23:12:40,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-11-06 23:12:40,812 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-11-06 23:12:40,812 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 106 flow [2023-11-06 23:12:40,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 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:12:40,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:40,814 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, 1] [2023-11-06 23:12:40,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:12:40,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:12:40,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 785946502, now seen corresponding path program 1 times [2023-11-06 23:12:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:40,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705337736] [2023-11-06 23:12:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:12:41,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705337736] [2023-11-06 23:12:41,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705337736] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:12:41,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158745342] [2023-11-06 23:12:41,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:41,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:12:41,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:12:41,136 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:12:41,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:12:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:41,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 23:12:41,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:41,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:12:41,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:12:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:12:41,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158745342] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 23:12:41,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 23:12:41,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2023-11-06 23:12:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040255139] [2023-11-06 23:12:41,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:41,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:12:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:12:41,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:12:41,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 502 [2023-11-06 23:12:41,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 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:12:41,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:41,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 502 [2023-11-06 23:12:41,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:42,736 INFO L124 PetriNetUnfolderBase]: 2751/3628 cut-off events. [2023-11-06 23:12:42,737 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2023-11-06 23:12:42,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8289 conditions, 3628 events. 2751/3628 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 16288 event pairs, 109 based on Foata normal form. 72/2738 useless extension candidates. Maximal degree in co-relation 8275. Up to 1127 conditions per place. [2023-11-06 23:12:42,778 INFO L140 encePairwiseOnDemand]: 494/502 looper letters, 90 selfloop transitions, 13 changer transitions 0/106 dead transitions. [2023-11-06 23:12:42,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 106 transitions, 490 flow [2023-11-06 23:12:42,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:12:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:12:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1592 transitions. [2023-11-06 23:12:42,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45304496300512237 [2023-11-06 23:12:42,788 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1592 transitions. [2023-11-06 23:12:42,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1592 transitions. [2023-11-06 23:12:42,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:42,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1592 transitions. [2023-11-06 23:12:42,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 227.42857142857142) internal successors, (1592), 7 states have internal predecessors, (1592), 0 states have call successors, (0), 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:12:42,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 502.0) internal successors, (4016), 8 states have internal predecessors, (4016), 0 states have call successors, (0), 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:12:42,811 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 502.0) internal successors, (4016), 8 states have internal predecessors, (4016), 0 states have call successors, (0), 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:12:42,812 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 106 flow. Second operand 7 states and 1592 transitions. [2023-11-06 23:12:42,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 106 transitions, 490 flow [2023-11-06 23:12:42,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 106 transitions, 482 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:42,818 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 193 flow [2023-11-06 23:12:42,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=193, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-11-06 23:12:42,819 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-11-06 23:12:42,820 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 193 flow [2023-11-06 23:12:42,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 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:12:42,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:42,822 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, 1] [2023-11-06 23:12:42,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:12:43,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-06 23:12:43,039 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:12:43,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1565962176, now seen corresponding path program 2 times [2023-11-06 23:12:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170917610] [2023-11-06 23:12:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:12:43,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:43,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170917610] [2023-11-06 23:12:43,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170917610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:12:43,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:12:43,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:12:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87252415] [2023-11-06 23:12:43,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:12:43,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:12:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:43,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:12:43,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:12:43,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 502 [2023-11-06 23:12:43,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 223.2) internal successors, (1116), 5 states have internal predecessors, (1116), 0 states have call successors, (0), 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:12:43,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:43,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 502 [2023-11-06 23:12:43,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:44,423 INFO L124 PetriNetUnfolderBase]: 3371/4451 cut-off events. [2023-11-06 23:12:44,423 INFO L125 PetriNetUnfolderBase]: For 3306/3465 co-relation queries the response was YES. [2023-11-06 23:12:44,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12724 conditions, 4451 events. 3371/4451 cut-off events. For 3306/3465 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 20017 event pairs, 336 based on Foata normal form. 255/3762 useless extension candidates. Maximal degree in co-relation 12702. Up to 3282 conditions per place. [2023-11-06 23:12:44,485 INFO L140 encePairwiseOnDemand]: 495/502 looper letters, 71 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-11-06 23:12:44,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 488 flow [2023-11-06 23:12:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:12:44,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:12:44,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2023-11-06 23:12:44,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45750332005312083 [2023-11-06 23:12:44,493 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1378 transitions. [2023-11-06 23:12:44,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1378 transitions. [2023-11-06 23:12:44,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:44,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1378 transitions. [2023-11-06 23:12:44,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 229.66666666666666) internal successors, (1378), 6 states have internal predecessors, (1378), 0 states have call successors, (0), 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:12:44,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 502.0) internal successors, (3514), 7 states have internal predecessors, (3514), 0 states have call successors, (0), 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:12:44,512 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 502.0) internal successors, (3514), 7 states have internal predecessors, (3514), 0 states have call successors, (0), 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:12:44,512 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 193 flow. Second operand 6 states and 1378 transitions. [2023-11-06 23:12:44,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 488 flow [2023-11-06 23:12:44,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 465 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-11-06 23:12:44,541 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 247 flow [2023-11-06 23:12:44,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-11-06 23:12:44,543 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-11-06 23:12:44,543 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 247 flow [2023-11-06 23:12:44,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 223.2) internal successors, (1116), 5 states have internal predecessors, (1116), 0 states have call successors, (0), 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:12:44,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:44,545 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, 1, 1, 1] [2023-11-06 23:12:44,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:12:44,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:12:44,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:44,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1220794676, now seen corresponding path program 1 times [2023-11-06 23:12:44,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445634922] [2023-11-06 23:12:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445634922] [2023-11-06 23:12:45,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445634922] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:12:45,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683937753] [2023-11-06 23:12:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:45,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:12:45,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:12:45,549 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:12:45,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:12:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:45,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 23:12:45,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:46,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 23:12:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:46,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:12:46,463 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:12:46,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2023-11-06 23:12:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:46,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683937753] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:12:46,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:12:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-11-06 23:12:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876262121] [2023-11-06 23:12:46,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:12:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 23:12:46,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 23:12:46,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-11-06 23:12:47,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 502 [2023-11-06 23:12:47,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 247 flow. Second operand has 18 states, 18 states have (on average 196.27777777777777) internal successors, (3533), 18 states have internal predecessors, (3533), 0 states have call successors, (0), 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:12:47,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:12:47,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 502 [2023-11-06 23:12:47,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:12:52,090 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 132#$Ultimate##0true, 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), 34#thread1EXITtrue, 181#L143-4true, Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,090 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:12:52,090 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 23:12:52,091 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:12:52,091 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:12:52,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 132#$Ultimate##0true, 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), 133#L144-1true, Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), 34#thread1EXITtrue, Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,431 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:12:52,431 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:12:52,431 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:12:52,431 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:12:52,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), 34#thread1EXITtrue, 181#L143-4true, Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 46#thread2EXITtrue, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,619 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:12:52,619 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:12:52,619 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:12:52,619 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:52,635 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), 34#thread1EXITtrue, 181#L143-4true, Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 204#L77true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,635 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:12:52,635 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:12:52,635 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:52,636 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:12:52,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [60#L144-2true, Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 132#$Ultimate##0true, 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,659 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 23:12:52,660 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:52,660 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:12:52,660 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:12:52,975 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), 133#L144-1true, Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), 34#thread1EXITtrue, Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 46#thread2EXITtrue, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,975 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 23:12:52,976 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:52,976 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:12:52,976 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:12:52,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), 133#L144-1true, Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), 34#thread1EXITtrue, Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 204#L77true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,987 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 23:12:52,987 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:12:52,988 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:52,988 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:12:52,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 132#$Ultimate##0true, 462#true, 59#L145-1true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:52,999 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 23:12:52,999 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:12:53,000 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:12:53,000 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:53,095 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [60#L144-2true, Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 46#thread2EXITtrue, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:53,095 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 23:12:53,096 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 23:12:53,096 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:12:53,096 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:12:53,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [60#L144-2true, Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 204#L77true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:53,103 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 23:12:53,104 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 23:12:53,104 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:12:53,104 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:12:53,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 59#L145-1true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 46#thread2EXITtrue, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:53,178 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 23:12:53,178 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:53,178 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 23:12:53,178 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 23:12:53,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 59#L145-1true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 204#L77true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:53,183 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 23:12:53,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 23:12:53,183 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:12:53,183 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 23:12:53,228 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), 43#L145-2true, Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:53,229 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-06 23:12:53,229 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 23:12:53,229 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 23:12:53,229 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 23:12:53,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([984] L95-->L92: Formula: (and (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~n1~0_22) (< v_~q1_front~0_49 v_~q1_back~0_59)) 1 0) 0)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (<= v_~total~0_63 2147483647) (<= 0 (+ v_~total~0_63 2147483648)) (= |v_thread3Thread1of1ForFork0_plus_#res#1_5| v_~total~0_63) (not (= (mod |v_thread3Thread1of1ForFork0_~cond~2#1_13| 256) 0)) (= (+ v_~total~0_64 (select (select |v_#memory_int_89| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_49)))) |v_thread3Thread1of1ForFork0_plus_#res#1_5|)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_59, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_64} OutVars{thread3Thread1of1ForFork0_plus_#res#1=|v_thread3Thread1of1ForFork0_plus_#res#1_5|, ~q1~0.offset=v_~q1~0.offset_29, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q1_front~0=v_~q1_front~0_48, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, ~n1~0=v_~n1~0_22, thread3Thread1of1ForFork0_#t~ret10#1=|v_thread3Thread1of1ForFork0_#t~ret10#1_5|, thread3Thread1of1ForFork0_#t~mem9#1=|v_thread3Thread1of1ForFork0_#t~mem9#1_5|, thread3Thread1of1ForFork0_~cond~2#1=|v_thread3Thread1of1ForFork0_~cond~2#1_13|, ~total~0=v_~total~0_63, thread3Thread1of1ForFork0_plus_~a#1=|v_thread3Thread1of1ForFork0_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_59, thread3Thread1of1ForFork0_plus_#in~a#1=|v_thread3Thread1of1ForFork0_plus_#in~a#1_5|, thread3Thread1of1ForFork0_plus_#in~b#1=|v_thread3Thread1of1ForFork0_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_89|, thread3Thread1of1ForFork0_#t~post11#1=|v_thread3Thread1of1ForFork0_#t~post11#1_5|, thread3Thread1of1ForFork0_plus_~b#1=|v_thread3Thread1of1ForFork0_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_plus_#res#1, thread3Thread1of1ForFork0_plus_~a#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q1_front~0, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_plus_#in~a#1, thread3Thread1of1ForFork0_plus_#in~b#1, thread3Thread1of1ForFork0_#t~ret10#1, thread3Thread1of1ForFork0_#t~mem9#1, thread3Thread1of1ForFork0_#t~post11#1, thread3Thread1of1ForFork0_plus_~b#1, ~total~0][199], [120#L146-1true, Black: 255#(and (<= (+ ~i~0 1) ~N~0) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 462#true, 16#L92true, Black: 260#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 437#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))), Black: 408#(< ~q1_front~0 ~q1_back~0), Black: 455#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 451#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1)))), Black: 466#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), Black: 468#(and (<= 1 |thread3Thread1of1ForFork0_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (div |thread3Thread1of1ForFork0_~cond~2#1| 256) 0)), 472#true, 121#L110true, 453#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< ~N~0 (+ ~i~0 1))))]) [2023-11-06 23:12:53,255 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 23:12:53,255 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 23:12:53,255 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 23:12:53,256 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 23:12:53,327 INFO L124 PetriNetUnfolderBase]: 13330/17988 cut-off events. [2023-11-06 23:12:53,328 INFO L125 PetriNetUnfolderBase]: For 20597/22019 co-relation queries the response was YES. [2023-11-06 23:12:53,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52216 conditions, 17988 events. 13330/17988 cut-off events. For 20597/22019 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 100771 event pairs, 764 based on Foata normal form. 783/14731 useless extension candidates. Maximal degree in co-relation 39280. Up to 4790 conditions per place. [2023-11-06 23:12:53,548 INFO L140 encePairwiseOnDemand]: 491/502 looper letters, 288 selfloop transitions, 89 changer transitions 8/396 dead transitions. [2023-11-06 23:12:53,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 396 transitions, 2268 flow [2023-11-06 23:12:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:12:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-06 23:12:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4790 transitions. [2023-11-06 23:12:53,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148622899705526 [2023-11-06 23:12:53,574 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4790 transitions. [2023-11-06 23:12:53,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4790 transitions. [2023-11-06 23:12:53,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:12:53,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4790 transitions. [2023-11-06 23:12:53,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 208.2608695652174) internal successors, (4790), 23 states have internal predecessors, (4790), 0 states have call successors, (0), 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:12:53,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 502.0) internal successors, (12048), 24 states have internal predecessors, (12048), 0 states have call successors, (0), 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:12:53,628 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 502.0) internal successors, (12048), 24 states have internal predecessors, (12048), 0 states have call successors, (0), 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:12:53,628 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 247 flow. Second operand 23 states and 4790 transitions. [2023-11-06 23:12:53,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 396 transitions, 2268 flow [2023-11-06 23:12:53,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 396 transitions, 2263 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 23:12:53,715 INFO L231 Difference]: Finished difference. Result has 92 places, 152 transitions, 1156 flow [2023-11-06 23:12:53,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1156, PETRI_PLACES=92, PETRI_TRANSITIONS=152} [2023-11-06 23:12:53,718 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2023-11-06 23:12:53,718 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 152 transitions, 1156 flow [2023-11-06 23:12:53,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 196.27777777777777) internal successors, (3533), 18 states have internal predecessors, (3533), 0 states have call successors, (0), 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:12:53,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:12:53,722 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, 1, 1, 1] [2023-11-06 23:12:53,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:12:53,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:12:53,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:12:53,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:12:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1163471712, now seen corresponding path program 2 times [2023-11-06 23:12:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:12:53,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732550574] [2023-11-06 23:12:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:12:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:12:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:12:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:55,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:12:55,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732550574] [2023-11-06 23:12:55,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732550574] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:12:55,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754833659] [2023-11-06 23:12:55,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:12:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:12:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:12:55,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:12:55,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:12:55,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:12:55,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:12:55,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 23:12:55,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:12:55,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-06 23:12:55,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:12:55,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:12:55,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 23:12:56,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:12:56,113 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 23:12:56,277 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-06 23:12:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:56,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:12:57,464 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:12:57,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2023-11-06 23:12:57,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1639 treesize of output 1591 [2023-11-06 23:12:57,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 199 [2023-11-06 23:12:57,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 260 [2023-11-06 23:12:57,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 163 [2023-11-06 23:12:57,685 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 161 [2023-11-06 23:12:58,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:12:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754833659] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:12:58,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:12:58,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2023-11-06 23:12:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445728391] [2023-11-06 23:12:58,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:12:58,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-06 23:12:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:12:58,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-06 23:12:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=503, Unknown=9, NotChecked=0, Total=600 [2023-11-06 23:13:01,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 502 [2023-11-06 23:13:01,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 152 transitions, 1156 flow. Second operand has 25 states, 25 states have (on average 159.88) internal successors, (3997), 25 states have internal predecessors, (3997), 0 states have call successors, (0), 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:13:01,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:13:01,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 502 [2023-11-06 23:13:01,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:13:04,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:13:11,135 INFO L124 PetriNetUnfolderBase]: 24564/32207 cut-off events. [2023-11-06 23:13:11,135 INFO L125 PetriNetUnfolderBase]: For 63293/63557 co-relation queries the response was YES. [2023-11-06 23:13:11,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108627 conditions, 32207 events. 24564/32207 cut-off events. For 63293/63557 co-relation queries the response was YES. Maximal size of possible extension queue 1703. Compared 182482 event pairs, 4498 based on Foata normal form. 269/28117 useless extension candidates. Maximal degree in co-relation 102004. Up to 11769 conditions per place. [2023-11-06 23:13:11,465 INFO L140 encePairwiseOnDemand]: 490/502 looper letters, 211 selfloop transitions, 97 changer transitions 7/320 dead transitions. [2023-11-06 23:13:11,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 320 transitions, 2681 flow [2023-11-06 23:13:11,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 23:13:11,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-06 23:13:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2998 transitions. [2023-11-06 23:13:11,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33178397521027003 [2023-11-06 23:13:11,478 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2998 transitions. [2023-11-06 23:13:11,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2998 transitions. [2023-11-06 23:13:11,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:13:11,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2998 transitions. [2023-11-06 23:13:11,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 166.55555555555554) internal successors, (2998), 18 states have internal predecessors, (2998), 0 states have call successors, (0), 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:13:11,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 502.0) internal successors, (9538), 19 states have internal predecessors, (9538), 0 states have call successors, (0), 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:13:11,509 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 502.0) internal successors, (9538), 19 states have internal predecessors, (9538), 0 states have call successors, (0), 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:13:11,509 INFO L175 Difference]: Start difference. First operand has 92 places, 152 transitions, 1156 flow. Second operand 18 states and 2998 transitions. [2023-11-06 23:13:11,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 320 transitions, 2681 flow [2023-11-06 23:13:11,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 320 transitions, 2620 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 23:13:11,931 INFO L231 Difference]: Finished difference. Result has 116 places, 200 transitions, 1867 flow [2023-11-06 23:13:11,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1867, PETRI_PLACES=116, PETRI_TRANSITIONS=200} [2023-11-06 23:13:11,933 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 74 predicate places. [2023-11-06 23:13:11,933 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 200 transitions, 1867 flow [2023-11-06 23:13:11,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 159.88) internal successors, (3997), 25 states have internal predecessors, (3997), 0 states have call successors, (0), 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:13:11,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:13:11,936 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:13:11,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:13:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 23:13:12,150 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:13:12,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:13:12,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1919497661, now seen corresponding path program 3 times [2023-11-06 23:13:12,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:13:12,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090211774] [2023-11-06 23:13:12,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:13:12,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:13:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:13:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:13:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:13:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090211774] [2023-11-06 23:13:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090211774] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:13:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584882436] [2023-11-06 23:13:13,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:13:13,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:13:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:13:13,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:13:13,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:13:13,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 23:13:13,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:13:13,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 23:13:13,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:13:14,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:13:14,012 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500 treesize of output 484 [2023-11-06 23:13:14,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:13:14,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 23:13:14,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 23:13:14,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-11-06 23:13:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 23:13:14,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:13:14,753 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:13:14,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 79 [2023-11-06 23:13:14,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2023-11-06 23:13:14,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2023-11-06 23:13:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 23:13:15,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584882436] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:13:15,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:13:15,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2023-11-06 23:13:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007892730] [2023-11-06 23:13:15,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:13:15,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 23:13:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:13:15,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 23:13:15,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=428, Unknown=6, NotChecked=0, Total=506 [2023-11-06 23:13:16,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 502 [2023-11-06 23:13:16,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 200 transitions, 1867 flow. Second operand has 23 states, 23 states have (on average 165.8695652173913) internal successors, (3815), 23 states have internal predecessors, (3815), 0 states have call successors, (0), 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:13:16,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:13:16,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 502 [2023-11-06 23:13:16,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:13:25,361 INFO L124 PetriNetUnfolderBase]: 32277/42352 cut-off events. [2023-11-06 23:13:25,361 INFO L125 PetriNetUnfolderBase]: For 112097/112469 co-relation queries the response was YES. [2023-11-06 23:13:25,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153071 conditions, 42352 events. 32277/42352 cut-off events. For 112097/112469 co-relation queries the response was YES. Maximal size of possible extension queue 2219. Compared 248996 event pairs, 5185 based on Foata normal form. 458/37088 useless extension candidates. Maximal degree in co-relation 145943. Up to 18166 conditions per place. [2023-11-06 23:13:26,080 INFO L140 encePairwiseOnDemand]: 493/502 looper letters, 229 selfloop transitions, 116 changer transitions 1/351 dead transitions. [2023-11-06 23:13:26,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 351 transitions, 3545 flow [2023-11-06 23:13:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 23:13:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-06 23:13:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2258 transitions. [2023-11-06 23:13:26,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34600061293288387 [2023-11-06 23:13:26,098 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2258 transitions. [2023-11-06 23:13:26,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2258 transitions. [2023-11-06 23:13:26,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:13:26,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2258 transitions. [2023-11-06 23:13:26,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 173.69230769230768) internal successors, (2258), 13 states have internal predecessors, (2258), 0 states have call successors, (0), 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:13:26,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 502.0) internal successors, (7028), 14 states have internal predecessors, (7028), 0 states have call successors, (0), 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:13:26,126 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 502.0) internal successors, (7028), 14 states have internal predecessors, (7028), 0 states have call successors, (0), 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:13:26,126 INFO L175 Difference]: Start difference. First operand has 116 places, 200 transitions, 1867 flow. Second operand 13 states and 2258 transitions. [2023-11-06 23:13:26,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 351 transitions, 3545 flow [2023-11-06 23:13:27,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 351 transitions, 3409 flow, removed 34 selfloop flow, removed 12 redundant places. [2023-11-06 23:13:27,013 INFO L231 Difference]: Finished difference. Result has 117 places, 242 transitions, 2515 flow [2023-11-06 23:13:27,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=502, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2515, PETRI_PLACES=117, PETRI_TRANSITIONS=242} [2023-11-06 23:13:27,014 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places. [2023-11-06 23:13:27,015 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 242 transitions, 2515 flow [2023-11-06 23:13:27,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 165.8695652173913) internal successors, (3815), 23 states have internal predecessors, (3815), 0 states have call successors, (0), 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:13:27,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:13:27,016 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:13:27,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:13:27,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:13:27,223 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 23:13:27,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:13:27,224 INFO L85 PathProgramCache]: Analyzing trace with hash -281043533, now seen corresponding path program 4 times [2023-11-06 23:13:27,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:13:27,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556596386] [2023-11-06 23:13:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:13:27,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:13:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:13:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:13:28,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:13:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556596386] [2023-11-06 23:13:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556596386] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:13:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451454864] [2023-11-06 23:13:28,796 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:13:28,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:13:28,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:13:28,799 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:13:28,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a517dce7-4394-4c73-ae65-f755559085c1/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:13:28,996 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:13:28,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:13:28,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-06 23:13:29,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:13:29,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:13:29,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:13:29,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-11-06 23:13:29,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 23:13:29,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:13:29,618 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 23:13:29,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:13:29,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-06 23:13:29,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2023-11-06 23:13:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:13:29,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:13:30,603 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 23:13:30,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 325 [2023-11-06 23:13:30,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2023-11-06 23:13:30,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2023-11-06 23:13:30,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 110 [2023-11-06 23:13:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:13:31,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451454864] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:13:31,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:13:31,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-11-06 23:13:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570701446] [2023-11-06 23:13:31,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:13:31,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 23:13:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:13:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 23:13:31,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=636, Unknown=6, NotChecked=0, Total=756 [2023-11-06 23:13:33,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 502 [2023-11-06 23:13:33,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 242 transitions, 2515 flow. Second operand has 28 states, 28 states have (on average 162.67857142857142) internal successors, (4555), 28 states have internal predecessors, (4555), 0 states have call successors, (0), 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:13:33,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:13:33,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 502 [2023-11-06 23:13:33,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand