./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/popl20-more-buffer-series2.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c ./goblint.2024-06-19_11-23-25.files/protection/popl20-more-buffer-series2.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 18:03:07,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 18:03:08,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 18:03:08,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 18:03:08,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 18:03:08,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 18:03:08,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 18:03:08,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 18:03:08,095 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 18:03:08,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 18:03:08,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 18:03:08,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 18:03:08,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 18:03:08,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 18:03:08,100 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 18:03:08,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 18:03:08,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 18:03:08,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 18:03:08,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 18:03:08,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 18:03:08,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 18:03:08,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 18:03:08,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 18:03:08,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 18:03:08,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 18:03:08,102 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 18:03:08,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 18:03:08,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 18:03:08,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 18:03:08,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 18:03:08,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 18:03:08,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 18:03:08,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:03:08,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 18:03:08,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 18:03:08,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 18:03:08,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 18:03:08,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 18:03:08,105 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 18:03:08,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 18:03:08,106 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 18:03:08,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 18:03:08,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 18:03:08,106 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 18:03:08,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 18:03:08,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 18:03:08,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 18:03:08,360 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 18:03:08,361 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 18:03:08,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/popl20-more-buffer-series2.wvr.yml/witness.yml [2024-06-27 18:03:08,442 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 18:03:08,443 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 18:03:08,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-27 18:03:09,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 18:03:09,768 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 18:03:09,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2024-06-27 18:03:09,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351594fba/671030568abe447ca672e931a87ec5e8/FLAG4fff18b7a [2024-06-27 18:03:09,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/351594fba/671030568abe447ca672e931a87ec5e8 [2024-06-27 18:03:09,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 18:03:09,793 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 18:03:09,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 18:03:09,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 18:03:09,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 18:03:09,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:08" (1/2) ... [2024-06-27 18:03:09,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2152fc21 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:09, skipping insertion in model container [2024-06-27 18:03:09,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:08" (1/2) ... [2024-06-27 18:03:09,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70f015c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 06:03:09, skipping insertion in model container [2024-06-27 18:03:09,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:03:09" (2/2) ... [2024-06-27 18:03:09,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2152fc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:09, skipping insertion in model container [2024-06-27 18:03:09,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 06:03:09" (2/2) ... [2024-06-27 18:03:09,804 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 18:03:09,822 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 18:03:09,825 INFO L97 edCorrectnessWitness]: Location invariant before [L144-L144] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 18:03:09,825 INFO L97 edCorrectnessWitness]: Location invariant before [L142-L142] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 18:03:09,826 INFO L97 edCorrectnessWitness]: Location invariant before [L143-L143] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 18:03:09,826 INFO L97 edCorrectnessWitness]: Location invariant before [L145-L145] (! multithreaded || 0 <= j) && (! multithreaded || 0 <= i) [2024-06-27 18:03:09,826 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 18:03:09,826 INFO L106 edCorrectnessWitness]: ghost_update [L141-L141] multithreaded = 1; [2024-06-27 18:03:09,847 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 18:03:10,163 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-27 18:03:10,170 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:03:10,177 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 18:03:10,238 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4284,4297] [2024-06-27 18:03:10,241 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 18:03:10,257 INFO L206 MainTranslator]: Completed translation [2024-06-27 18:03:10,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10 WrapperNode [2024-06-27 18:03:10,260 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 18:03:10,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 18:03:10,261 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 18:03:10,261 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 18:03:10,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,319 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 343 [2024-06-27 18:03:10,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 18:03:10,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 18:03:10,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 18:03:10,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 18:03:10,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,365 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-06-27 18:03:10,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,392 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 18:03:10,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 18:03:10,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 18:03:10,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 18:03:10,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (1/1) ... [2024-06-27 18:03:10,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 18:03:10,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:10,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 18:03:10,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 18:03:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 18:03:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 18:03:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 18:03:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 18:03:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 18:03:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 18:03:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 18:03:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 18:03:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 18:03:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 18:03:10,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 18:03:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 18:03:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 18:03:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 18:03:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 18:03:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 18:03:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 18:03:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 18:03:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 18:03:10,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 18:03:10,459 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 18:03:10,539 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 18:03:10,541 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 18:03:10,902 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 18:03:10,903 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 18:03:11,251 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 18:03:11,252 INFO L320 CfgBuilder]: Removed 7 assume(true) statements. [2024-06-27 18:03:11,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:03:11 BoogieIcfgContainer [2024-06-27 18:03:11,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 18:03:11,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 18:03:11,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 18:03:11,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 18:03:11,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 06:03:08" (1/4) ... [2024-06-27 18:03:11,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db09ee1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 06:03:11, skipping insertion in model container [2024-06-27 18:03:11,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 06:03:09" (2/4) ... [2024-06-27 18:03:11,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db09ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:03:11, skipping insertion in model container [2024-06-27 18:03:11,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 06:03:10" (3/4) ... [2024-06-27 18:03:11,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3db09ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 06:03:11, skipping insertion in model container [2024-06-27 18:03:11,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 06:03:11" (4/4) ... [2024-06-27 18:03:11,264 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2024-06-27 18:03:11,290 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 18:03:11,293 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 18:03:11,293 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 18:03:11,350 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-27 18:03:11,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 146 flow [2024-06-27 18:03:11,416 INFO L124 PetriNetUnfolderBase]: 7/55 cut-off events. [2024-06-27 18:03:11,416 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 18:03:11,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 7/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 18:03:11,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 59 transitions, 146 flow [2024-06-27 18:03:11,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 54 transitions, 132 flow [2024-06-27 18:03:11,436 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 18:03:11,446 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e253a1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 18:03:11,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 18:03:11,453 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 18:03:11,453 INFO L124 PetriNetUnfolderBase]: 3/12 cut-off events. [2024-06-27 18:03:11,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 18:03:11,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:11,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:11,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:11,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1215902037, now seen corresponding path program 1 times [2024-06-27 18:03:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:11,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577013057] [2024-06-27 18:03:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:11,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577013057] [2024-06-27 18:03:11,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577013057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:11,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:11,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 18:03:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486238299] [2024-06-27 18:03:11,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:11,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:11,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:11,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:11,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-27 18:03:11,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:11,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:11,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-27 18:03:11,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:12,181 INFO L124 PetriNetUnfolderBase]: 1246/2108 cut-off events. [2024-06-27 18:03:12,181 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-06-27 18:03:12,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4058 conditions, 2108 events. 1246/2108 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 13798 event pairs, 448 based on Foata normal form. 54/2003 useless extension candidates. Maximal degree in co-relation 3515. Up to 1117 conditions per place. [2024-06-27 18:03:12,198 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 56 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-06-27 18:03:12,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 77 transitions, 315 flow [2024-06-27 18:03:12,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-06-27 18:03:12,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7401129943502824 [2024-06-27 18:03:12,208 INFO L175 Difference]: Start difference. First operand has 60 places, 54 transitions, 132 flow. Second operand 3 states and 131 transitions. [2024-06-27 18:03:12,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 77 transitions, 315 flow [2024-06-27 18:03:12,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 77 transitions, 285 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 18:03:12,216 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 134 flow [2024-06-27 18:03:12,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2024-06-27 18:03:12,220 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-06-27 18:03:12,220 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 134 flow [2024-06-27 18:03:12,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:12,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:12,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:12,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 18:03:12,221 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:12,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:12,221 INFO L85 PathProgramCache]: Analyzing trace with hash 568481228, now seen corresponding path program 1 times [2024-06-27 18:03:12,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059567929] [2024-06-27 18:03:12,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:12,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:12,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:12,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059567929] [2024-06-27 18:03:12,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059567929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:12,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:12,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879753622] [2024-06-27 18:03:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:12,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:12,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:12,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:12,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2024-06-27 18:03:12,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:12,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:12,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2024-06-27 18:03:12,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:12,535 INFO L124 PetriNetUnfolderBase]: 1030/1812 cut-off events. [2024-06-27 18:03:12,535 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2024-06-27 18:03:12,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1812 events. 1030/1812 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11762 event pairs, 408 based on Foata normal form. 80/1799 useless extension candidates. Maximal degree in co-relation 1472. Up to 820 conditions per place. [2024-06-27 18:03:12,547 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 52 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-06-27 18:03:12,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 277 flow [2024-06-27 18:03:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 18:03:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 18:03:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-06-27 18:03:12,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.635593220338983 [2024-06-27 18:03:12,556 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 134 flow. Second operand 4 states and 150 transitions. [2024-06-27 18:03:12,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 277 flow [2024-06-27 18:03:12,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:12,560 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 120 flow [2024-06-27 18:03:12,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-06-27 18:03:12,564 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2024-06-27 18:03:12,565 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 120 flow [2024-06-27 18:03:12,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:12,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:12,565 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, 1, 1, 1, 1] [2024-06-27 18:03:12,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 18:03:12,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:12,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash -554483795, now seen corresponding path program 1 times [2024-06-27 18:03:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:12,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095067489] [2024-06-27 18:03:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:12,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:12,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:12,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095067489] [2024-06-27 18:03:12,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095067489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:12,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:12,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:12,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215461684] [2024-06-27 18:03:12,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:12,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:12,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:12,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:12,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-27 18:03:12,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:12,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:12,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-27 18:03:12,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:12,906 INFO L124 PetriNetUnfolderBase]: 1756/2924 cut-off events. [2024-06-27 18:03:12,906 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2024-06-27 18:03:12,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5703 conditions, 2924 events. 1756/2924 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 18181 event pairs, 433 based on Foata normal form. 2/2775 useless extension candidates. Maximal degree in co-relation 2779. Up to 1601 conditions per place. [2024-06-27 18:03:12,922 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 45 selfloop transitions, 3 changer transitions 1/68 dead transitions. [2024-06-27 18:03:12,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 263 flow [2024-06-27 18:03:12,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-06-27 18:03:12,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7288135593220338 [2024-06-27 18:03:12,923 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 120 flow. Second operand 3 states and 129 transitions. [2024-06-27 18:03:12,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 263 flow [2024-06-27 18:03:12,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:03:12,925 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 136 flow [2024-06-27 18:03:12,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2024-06-27 18:03:12,926 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2024-06-27 18:03:12,926 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 136 flow [2024-06-27 18:03:12,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:12,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:12,926 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, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:12,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 18:03:12,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:12,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash 947426328, now seen corresponding path program 1 times [2024-06-27 18:03:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:12,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424374333] [2024-06-27 18:03:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:12,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:13,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424374333] [2024-06-27 18:03:13,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424374333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:13,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:13,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269387859] [2024-06-27 18:03:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:13,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:13,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:13,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:13,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:13,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-27 18:03:13,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:13,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:13,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-27 18:03:13,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:13,252 INFO L124 PetriNetUnfolderBase]: 1318/2203 cut-off events. [2024-06-27 18:03:13,253 INFO L125 PetriNetUnfolderBase]: For 616/616 co-relation queries the response was YES. [2024-06-27 18:03:13,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4797 conditions, 2203 events. 1318/2203 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13238 event pairs, 396 based on Foata normal form. 64/2179 useless extension candidates. Maximal degree in co-relation 1895. Up to 1249 conditions per place. [2024-06-27 18:03:13,268 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 54 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-06-27 18:03:13,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 306 flow [2024-06-27 18:03:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:13,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-27 18:03:13,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7627118644067796 [2024-06-27 18:03:13,269 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 136 flow. Second operand 3 states and 135 transitions. [2024-06-27 18:03:13,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 306 flow [2024-06-27 18:03:13,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:13,271 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 143 flow [2024-06-27 18:03:13,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-06-27 18:03:13,272 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2024-06-27 18:03:13,272 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 143 flow [2024-06-27 18:03:13,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:13,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:13,273 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, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:13,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 18:03:13,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:13,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:13,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1515826674, now seen corresponding path program 1 times [2024-06-27 18:03:13,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:13,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67270419] [2024-06-27 18:03:13,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:13,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:13,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:13,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67270419] [2024-06-27 18:03:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67270419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:13,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:13,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 18:03:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017849389] [2024-06-27 18:03:13,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:13,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 18:03:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:13,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 18:03:13,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 18:03:13,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-27 18:03:13,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:13,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:13,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-27 18:03:13,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:13,578 INFO L124 PetriNetUnfolderBase]: 1597/2651 cut-off events. [2024-06-27 18:03:13,581 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2024-06-27 18:03:13,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5869 conditions, 2651 events. 1597/2651 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15690 event pairs, 456 based on Foata normal form. 33/2574 useless extension candidates. Maximal degree in co-relation 3765. Up to 1422 conditions per place. [2024-06-27 18:03:13,596 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 53 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2024-06-27 18:03:13,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 319 flow [2024-06-27 18:03:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 18:03:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 18:03:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2024-06-27 18:03:13,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7457627118644068 [2024-06-27 18:03:13,599 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 143 flow. Second operand 3 states and 132 transitions. [2024-06-27 18:03:13,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 319 flow [2024-06-27 18:03:13,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 18:03:13,602 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 153 flow [2024-06-27 18:03:13,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2024-06-27 18:03:13,605 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2024-06-27 18:03:13,605 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 153 flow [2024-06-27 18:03:13,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:13,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:13,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:13,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 18:03:13,606 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:13,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1810419547, now seen corresponding path program 1 times [2024-06-27 18:03:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260658751] [2024-06-27 18:03:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:03:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260658751] [2024-06-27 18:03:13,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260658751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:13,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:13,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 18:03:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189062389] [2024-06-27 18:03:13,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:13,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:13,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:13,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-27 18:03:13,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:13,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:13,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-27 18:03:13,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:14,048 INFO L124 PetriNetUnfolderBase]: 2000/3351 cut-off events. [2024-06-27 18:03:14,048 INFO L125 PetriNetUnfolderBase]: For 1681/1681 co-relation queries the response was YES. [2024-06-27 18:03:14,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 3351 events. 2000/3351 cut-off events. For 1681/1681 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 22072 event pairs, 1442 based on Foata normal form. 84/3167 useless extension candidates. Maximal degree in co-relation 4240. Up to 2137 conditions per place. [2024-06-27 18:03:14,065 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 62 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2024-06-27 18:03:14,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 382 flow [2024-06-27 18:03:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 199 transitions. [2024-06-27 18:03:14,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6745762711864407 [2024-06-27 18:03:14,066 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 153 flow. Second operand 5 states and 199 transitions. [2024-06-27 18:03:14,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 382 flow [2024-06-27 18:03:14,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:14,069 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 203 flow [2024-06-27 18:03:14,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2024-06-27 18:03:14,069 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2024-06-27 18:03:14,070 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 203 flow [2024-06-27 18:03:14,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:14,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:14,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:14,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 18:03:14,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:14,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash -736145751, now seen corresponding path program 1 times [2024-06-27 18:03:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:14,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336661282] [2024-06-27 18:03:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:14,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:03:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336661282] [2024-06-27 18:03:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336661282] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:14,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 18:03:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509143758] [2024-06-27 18:03:14,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:14,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 18:03:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 18:03:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 18:03:14,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2024-06-27 18:03:14,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:14,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:14,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2024-06-27 18:03:14,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:14,998 INFO L124 PetriNetUnfolderBase]: 2624/4554 cut-off events. [2024-06-27 18:03:14,999 INFO L125 PetriNetUnfolderBase]: For 2326/2326 co-relation queries the response was YES. [2024-06-27 18:03:15,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10356 conditions, 4554 events. 2624/4554 cut-off events. For 2326/2326 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 32583 event pairs, 1964 based on Foata normal form. 128/4329 useless extension candidates. Maximal degree in co-relation 8120. Up to 2802 conditions per place. [2024-06-27 18:03:15,033 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 64 selfloop transitions, 7 changer transitions 2/92 dead transitions. [2024-06-27 18:03:15,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 459 flow [2024-06-27 18:03:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 18:03:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 18:03:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2024-06-27 18:03:15,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6610169491525424 [2024-06-27 18:03:15,049 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 203 flow. Second operand 5 states and 195 transitions. [2024-06-27 18:03:15,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 459 flow [2024-06-27 18:03:15,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 455 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:15,052 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 253 flow [2024-06-27 18:03:15,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2024-06-27 18:03:15,053 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2024-06-27 18:03:15,053 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 253 flow [2024-06-27 18:03:15,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:15,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:15,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:15,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 18:03:15,054 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:15,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1149376626, now seen corresponding path program 1 times [2024-06-27 18:03:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:15,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507383688] [2024-06-27 18:03:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:15,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:03:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507383688] [2024-06-27 18:03:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507383688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:15,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:15,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:03:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852132819] [2024-06-27 18:03:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:15,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:03:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:15,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:03:15,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:03:15,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2024-06-27 18:03:15,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:15,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:15,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2024-06-27 18:03:15,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:16,473 INFO L124 PetriNetUnfolderBase]: 6280/10272 cut-off events. [2024-06-27 18:03:16,473 INFO L125 PetriNetUnfolderBase]: For 4642/4780 co-relation queries the response was YES. [2024-06-27 18:03:16,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23360 conditions, 10272 events. 6280/10272 cut-off events. For 4642/4780 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 75593 event pairs, 2817 based on Foata normal form. 6/9332 useless extension candidates. Maximal degree in co-relation 17537. Up to 3689 conditions per place. [2024-06-27 18:03:16,589 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 104 selfloop transitions, 11 changer transitions 1/132 dead transitions. [2024-06-27 18:03:16,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 693 flow [2024-06-27 18:03:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:03:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:03:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 242 transitions. [2024-06-27 18:03:16,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6836158192090396 [2024-06-27 18:03:16,591 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 253 flow. Second operand 6 states and 242 transitions. [2024-06-27 18:03:16,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 693 flow [2024-06-27 18:03:16,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 132 transitions, 681 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:16,597 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 289 flow [2024-06-27 18:03:16,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2024-06-27 18:03:16,599 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 16 predicate places. [2024-06-27 18:03:16,599 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 289 flow [2024-06-27 18:03:16,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:16,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:16,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:16,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 18:03:16,600 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:16,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:16,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1812794255, now seen corresponding path program 1 times [2024-06-27 18:03:16,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:16,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74291180] [2024-06-27 18:03:16,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:16,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:03:16,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74291180] [2024-06-27 18:03:16,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74291180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:16,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:16,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:03:16,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410340566] [2024-06-27 18:03:16,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:16,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:03:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:16,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:03:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:03:16,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2024-06-27 18:03:16,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:16,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:16,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2024-06-27 18:03:16,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:17,884 INFO L124 PetriNetUnfolderBase]: 5662/8956 cut-off events. [2024-06-27 18:03:17,885 INFO L125 PetriNetUnfolderBase]: For 4857/4927 co-relation queries the response was YES. [2024-06-27 18:03:17,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20961 conditions, 8956 events. 5662/8956 cut-off events. For 4857/4927 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 63270 event pairs, 2088 based on Foata normal form. 0/8365 useless extension candidates. Maximal degree in co-relation 15651. Up to 4616 conditions per place. [2024-06-27 18:03:17,932 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 79 selfloop transitions, 13 changer transitions 8/117 dead transitions. [2024-06-27 18:03:17,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 117 transitions, 636 flow [2024-06-27 18:03:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:03:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:03:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 231 transitions. [2024-06-27 18:03:17,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.652542372881356 [2024-06-27 18:03:17,934 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 289 flow. Second operand 6 states and 231 transitions. [2024-06-27 18:03:17,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 117 transitions, 636 flow [2024-06-27 18:03:17,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 622 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 18:03:17,939 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 327 flow [2024-06-27 18:03:17,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=327, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2024-06-27 18:03:17,939 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 21 predicate places. [2024-06-27 18:03:17,940 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 327 flow [2024-06-27 18:03:17,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:17,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:17,940 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:17,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 18:03:17,941 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:17,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -201411273, now seen corresponding path program 2 times [2024-06-27 18:03:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645444942] [2024-06-27 18:03:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:03:18,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:18,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645444942] [2024-06-27 18:03:18,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645444942] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:18,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:18,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:03:18,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268124982] [2024-06-27 18:03:18,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:18,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:03:18,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:03:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:03:18,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2024-06-27 18:03:18,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:18,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:18,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2024-06-27 18:03:18,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:18,989 INFO L124 PetriNetUnfolderBase]: 5355/8891 cut-off events. [2024-06-27 18:03:18,989 INFO L125 PetriNetUnfolderBase]: For 4565/4565 co-relation queries the response was YES. [2024-06-27 18:03:19,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20780 conditions, 8891 events. 5355/8891 cut-off events. For 4565/4565 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 66432 event pairs, 3983 based on Foata normal form. 0/7927 useless extension candidates. Maximal degree in co-relation 16751. Up to 6942 conditions per place. [2024-06-27 18:03:19,028 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 40 selfloop transitions, 7 changer transitions 35/98 dead transitions. [2024-06-27 18:03:19,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 98 transitions, 542 flow [2024-06-27 18:03:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:03:19,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:03:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-06-27 18:03:19,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5988700564971752 [2024-06-27 18:03:19,030 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 327 flow. Second operand 6 states and 212 transitions. [2024-06-27 18:03:19,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 98 transitions, 542 flow [2024-06-27 18:03:19,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 98 transitions, 530 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 18:03:19,044 INFO L231 Difference]: Finished difference. Result has 85 places, 63 transitions, 277 flow [2024-06-27 18:03:19,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=85, PETRI_TRANSITIONS=63} [2024-06-27 18:03:19,047 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 25 predicate places. [2024-06-27 18:03:19,047 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 63 transitions, 277 flow [2024-06-27 18:03:19,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:19,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:19,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:19,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 18:03:19,048 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:19,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:19,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1652387365, now seen corresponding path program 1 times [2024-06-27 18:03:19,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:19,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368870592] [2024-06-27 18:03:19,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 18:03:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368870592] [2024-06-27 18:03:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368870592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:19,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:03:19,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339312753] [2024-06-27 18:03:19,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:19,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:03:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:19,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:03:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:03:19,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-27 18:03:19,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 63 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:19,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:19,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-27 18:03:19,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:20,011 INFO L124 PetriNetUnfolderBase]: 3441/5640 cut-off events. [2024-06-27 18:03:20,012 INFO L125 PetriNetUnfolderBase]: For 3472/3472 co-relation queries the response was YES. [2024-06-27 18:03:20,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14025 conditions, 5640 events. 3441/5640 cut-off events. For 3472/3472 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 37934 event pairs, 839 based on Foata normal form. 253/5690 useless extension candidates. Maximal degree in co-relation 11349. Up to 2464 conditions per place. [2024-06-27 18:03:20,043 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 74 selfloop transitions, 9 changer transitions 8/108 dead transitions. [2024-06-27 18:03:20,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 108 transitions, 624 flow [2024-06-27 18:03:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:03:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:03:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2024-06-27 18:03:20,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6053268765133172 [2024-06-27 18:03:20,046 INFO L175 Difference]: Start difference. First operand has 85 places, 63 transitions, 277 flow. Second operand 7 states and 250 transitions. [2024-06-27 18:03:20,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 108 transitions, 624 flow [2024-06-27 18:03:20,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 596 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-27 18:03:20,066 INFO L231 Difference]: Finished difference. Result has 79 places, 64 transitions, 275 flow [2024-06-27 18:03:20,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=79, PETRI_TRANSITIONS=64} [2024-06-27 18:03:20,066 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2024-06-27 18:03:20,066 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 64 transitions, 275 flow [2024-06-27 18:03:20,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:20,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:20,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 18:03:20,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:20,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash -632986370, now seen corresponding path program 1 times [2024-06-27 18:03:20,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:20,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205694791] [2024-06-27 18:03:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 18:03:20,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205694791] [2024-06-27 18:03:20,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205694791] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:20,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997915234] [2024-06-27 18:03:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:03:20,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:20,254 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:03:20,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 18:03:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:20,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 18:03:20,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:03:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 18:03:20,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:03:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 18:03:20,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997915234] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:20,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 18:03:20,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 5] total 14 [2024-06-27 18:03:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525680043] [2024-06-27 18:03:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:20,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 18:03:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:20,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 18:03:20,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-06-27 18:03:20,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-06-27 18:03:20,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 64 transitions, 275 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:20,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:20,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-06-27 18:03:20,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:21,802 INFO L124 PetriNetUnfolderBase]: 6367/9505 cut-off events. [2024-06-27 18:03:21,802 INFO L125 PetriNetUnfolderBase]: For 6516/6618 co-relation queries the response was YES. [2024-06-27 18:03:21,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24195 conditions, 9505 events. 6367/9505 cut-off events. For 6516/6618 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 59757 event pairs, 530 based on Foata normal form. 0/9139 useless extension candidates. Maximal degree in co-relation 19719. Up to 1924 conditions per place. [2024-06-27 18:03:21,859 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 168 selfloop transitions, 31 changer transitions 10/222 dead transitions. [2024-06-27 18:03:21,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 222 transitions, 1219 flow [2024-06-27 18:03:21,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 18:03:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 18:03:21,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 503 transitions. [2024-06-27 18:03:21,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683615819209039 [2024-06-27 18:03:21,862 INFO L175 Difference]: Start difference. First operand has 79 places, 64 transitions, 275 flow. Second operand 15 states and 503 transitions. [2024-06-27 18:03:21,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 222 transitions, 1219 flow [2024-06-27 18:03:21,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 222 transitions, 1170 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 18:03:21,869 INFO L231 Difference]: Finished difference. Result has 93 places, 82 transitions, 437 flow [2024-06-27 18:03:21,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=437, PETRI_PLACES=93, PETRI_TRANSITIONS=82} [2024-06-27 18:03:21,870 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 33 predicate places. [2024-06-27 18:03:21,870 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 82 transitions, 437 flow [2024-06-27 18:03:21,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:21,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:21,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:21,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 18:03:22,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-06-27 18:03:22,085 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:22,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash 897599078, now seen corresponding path program 1 times [2024-06-27 18:03:22,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:22,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964718227] [2024-06-27 18:03:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:22,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 18:03:22,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964718227] [2024-06-27 18:03:22,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964718227] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:22,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354817818] [2024-06-27 18:03:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:22,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:03:22,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:22,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:03:22,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 18:03:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:22,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 18:03:22,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:03:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 18:03:22,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:03:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 18:03:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354817818] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 18:03:22,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 5] total 11 [2024-06-27 18:03:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630146006] [2024-06-27 18:03:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:22,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 18:03:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:22,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 18:03:22,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-06-27 18:03:22,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2024-06-27 18:03:22,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 437 flow. Second operand has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:22,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:22,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2024-06-27 18:03:22,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:24,212 INFO L124 PetriNetUnfolderBase]: 9862/14734 cut-off events. [2024-06-27 18:03:24,212 INFO L125 PetriNetUnfolderBase]: For 37518/37864 co-relation queries the response was YES. [2024-06-27 18:03:24,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47309 conditions, 14734 events. 9862/14734 cut-off events. For 37518/37864 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 94179 event pairs, 1240 based on Foata normal form. 347/14048 useless extension candidates. Maximal degree in co-relation 47271. Up to 4298 conditions per place. [2024-06-27 18:03:24,360 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 108 selfloop transitions, 26 changer transitions 0/154 dead transitions. [2024-06-27 18:03:24,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 154 transitions, 1079 flow [2024-06-27 18:03:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:03:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:03:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-06-27 18:03:24,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6129943502824858 [2024-06-27 18:03:24,362 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 437 flow. Second operand 6 states and 217 transitions. [2024-06-27 18:03:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 154 transitions, 1079 flow [2024-06-27 18:03:24,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 154 transitions, 997 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-27 18:03:24,624 INFO L231 Difference]: Finished difference. Result has 94 places, 97 transitions, 608 flow [2024-06-27 18:03:24,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=608, PETRI_PLACES=94, PETRI_TRANSITIONS=97} [2024-06-27 18:03:24,626 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 34 predicate places. [2024-06-27 18:03:24,626 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 97 transitions, 608 flow [2024-06-27 18:03:24,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.857142857142858) internal successors, (181), 7 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:24,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:24,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:24,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-27 18:03:24,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-06-27 18:03:24,858 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:24,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:24,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1380134262, now seen corresponding path program 1 times [2024-06-27 18:03:24,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:24,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649473159] [2024-06-27 18:03:24,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 18:03:25,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649473159] [2024-06-27 18:03:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649473159] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429730066] [2024-06-27 18:03:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:25,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:03:25,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:25,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:03:25,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 18:03:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:25,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 18:03:25,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:03:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 18:03:25,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 18:03:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429730066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:25,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 18:03:25,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-06-27 18:03:25,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944256942] [2024-06-27 18:03:25,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:25,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 18:03:25,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:25,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 18:03:25,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 18:03:25,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-27 18:03:25,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 97 transitions, 608 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:25,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:25,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-27 18:03:25,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:26,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][124], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, Black: 78#(= ~total~0 0), 574#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 86#(= ~q2_back~0 ~q2_front~0), 7#L118true, 19#$Ultimate##0true, Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, Black: 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 53#L145true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,225 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,225 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,225 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-27 18:03:26,225 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-27 18:03:26,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][117], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, Black: 78#(= ~total~0 0), 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 86#(= ~q2_back~0 ~q2_front~0), 19#$Ultimate##0true, Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#L111true, Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, 53#L145true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,351 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-27 18:03:26,351 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 18:03:26,352 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-27 18:03:26,352 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-27 18:03:26,563 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][124], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, 56#thread3EXITtrue, Black: 78#(= ~total~0 0), 574#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 86#(= ~q2_back~0 ~q2_front~0), 7#L118true, Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, Black: 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 38#L144-5true, Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,563 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-27 18:03:26,563 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-27 18:03:26,563 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-27 18:03:26,563 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-27 18:03:26,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][124], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, Black: 78#(= ~total~0 0), 574#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 86#(= ~q2_back~0 ~q2_front~0), 7#L118true, 45#L100true, Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, Black: 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 461#(<= ~q2_front~0 ~q2_back~0), 53#L145true, Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,564 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-06-27 18:03:26,564 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-27 18:03:26,564 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-27 18:03:26,564 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-27 18:03:26,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][124], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, 56#thread3EXITtrue, Black: 78#(= ~total~0 0), 574#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 86#(= ~q2_back~0 ~q2_front~0), 7#L118true, Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, Black: 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 53#L145true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,675 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-27 18:03:26,676 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,676 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 18:03:26,676 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][117], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, 56#thread3EXITtrue, Black: 78#(= ~total~0 0), 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 86#(= ~q2_back~0 ~q2_front~0), Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#L111true, Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 38#L144-5true, Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,676 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-27 18:03:26,676 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 18:03:26,676 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,676 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][117], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, Black: 78#(= ~total~0 0), 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 86#(= ~q2_back~0 ~q2_front~0), 45#L100true, Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#L111true, Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, 53#L145true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,679 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-06-27 18:03:26,679 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-06-27 18:03:26,679 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,679 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:26,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][117], [Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 158#true, 44#L79true, 56#thread3EXITtrue, Black: 78#(= ~total~0 0), 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 86#(= ~q2_back~0 ~q2_front~0), Black: 149#(or (< ~j~0 ~N~0) (< ~q2_front~0 ~q2_back~0)), Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 93#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#L111true, Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, 53#L145true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:26,776 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-06-27 18:03:26,776 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 18:03:26,776 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 18:03:26,776 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-06-27 18:03:27,478 INFO L124 PetriNetUnfolderBase]: 10656/17241 cut-off events. [2024-06-27 18:03:27,478 INFO L125 PetriNetUnfolderBase]: For 79050/79815 co-relation queries the response was YES. [2024-06-27 18:03:27,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63365 conditions, 17241 events. 10656/17241 cut-off events. For 79050/79815 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 129001 event pairs, 2309 based on Foata normal form. 614/17189 useless extension candidates. Maximal degree in co-relation 63326. Up to 5249 conditions per place. [2024-06-27 18:03:27,793 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 151 selfloop transitions, 13 changer transitions 0/194 dead transitions. [2024-06-27 18:03:27,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 194 transitions, 1657 flow [2024-06-27 18:03:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 18:03:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 18:03:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 236 transitions. [2024-06-27 18:03:27,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 18:03:27,795 INFO L175 Difference]: Start difference. First operand has 94 places, 97 transitions, 608 flow. Second operand 6 states and 236 transitions. [2024-06-27 18:03:27,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 194 transitions, 1657 flow [2024-06-27 18:03:28,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 194 transitions, 1620 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 18:03:28,251 INFO L231 Difference]: Finished difference. Result has 100 places, 105 transitions, 686 flow [2024-06-27 18:03:28,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=686, PETRI_PLACES=100, PETRI_TRANSITIONS=105} [2024-06-27 18:03:28,252 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 40 predicate places. [2024-06-27 18:03:28,252 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 105 transitions, 686 flow [2024-06-27 18:03:28,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:28,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:28,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:28,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 18:03:28,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:03:28,477 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:28,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:28,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1277259880, now seen corresponding path program 2 times [2024-06-27 18:03:28,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:28,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85671065] [2024-06-27 18:03:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:28,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-06-27 18:03:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85671065] [2024-06-27 18:03:28,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85671065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 18:03:28,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 18:03:28,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 18:03:28,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857842802] [2024-06-27 18:03:28,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 18:03:28,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 18:03:28,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:03:28,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 18:03:28,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 18:03:28,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2024-06-27 18:03:28,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 105 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:28,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:03:28,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2024-06-27 18:03:28,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:03:29,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][123], [Black: 792#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 896#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 894#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 158#true, 44#L79true, 905#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 78#(= ~total~0 0), 574#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 86#(= ~q2_back~0 ~q2_front~0), 7#L118true, 19#$Ultimate##0true, Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, Black: 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), 53#L145true, Black: 461#(<= ~q2_front~0 ~q2_back~0), Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:29,597 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-06-27 18:03:29,597 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-27 18:03:29,597 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-27 18:03:29,597 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 18:03:29,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1008] L72-->L79: Formula: (let ((.cse0 (select (select |v_#memory_int#1_116| v_~f~0.base_110) (+ v_~f~0.offset_110 (* v_~j~0_113 4))))) (and (= v_~j~0_112 (+ v_~j~0_113 1)) (not (= (ite (and (<= 0 v_~q2_back~0_118) (< v_~q2_back~0_118 v_~n2~0_94)) 1 0) 0)) (= (+ v_~q2_back~0_118 1) v_~q2_back~0_117) (not (= (ite (< v_~q2_back~0_118 2147483647) 1 0) 0)) (not (= (ite (< 0 (+ .cse0 2147483648)) 1 0) 0)) (not (= (ite (= (+ (select (select |v_#memory_int#1_116| v_~q2~0.base_117) (+ v_~q2~0.offset_117 (* 4 v_~q2_back~0_118))) .cse0) 0) 1 0) 0)))) InVars {~j~0=v_~j~0_113, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, ~q2~0.base=v_~q2~0.base_117, #memory_int#1=|v_#memory_int#1_116|, ~q2_back~0=v_~q2_back~0_118, ~f~0.offset=v_~f~0.offset_110} OutVars{~j~0=v_~j~0_112, ~n2~0=v_~n2~0_94, ~f~0.base=v_~f~0.base_110, ~q2~0.offset=v_~q2~0.offset_117, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork0_#t~mem6#1=|v_thread2Thread1of1ForFork0_#t~mem6#1_1|, #memory_int#1=|v_#memory_int#1_116|, ~f~0.offset=v_~f~0.offset_110, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~mem5#1=|v_thread2Thread1of1ForFork0_#t~mem5#1_1|, ~q2~0.base=v_~q2~0.base_117, thread2Thread1of1ForFork0_#t~mem7#1=|v_thread2Thread1of1ForFork0_#t~mem7#1_1|, ~q2_back~0=v_~q2_back~0_117, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~j~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork0_#t~mem6#1, thread2Thread1of1ForFork0_#t~mem7#1, thread2Thread1of1ForFork0_#t~post9#1, ~q2_back~0, thread2Thread1of1ForFork0_#t~post8#1][118], [Black: 792#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 432#(and (<= ~i~0 0) (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), 436#(and (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 444#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), Black: 896#(and (<= ~q1_front~0 ~q1_back~0) (= 1 |thread3Thread1of1ForFork3_~cond~2#1|)), Black: 318#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0)), Black: 894#(and (= 1 |thread3Thread1of1ForFork3_~cond~2#1|) (<= (+ ~q1_front~0 1) ~q1_back~0)), Black: 158#true, 44#L79true, 905#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 78#(= ~total~0 0), 744#(and (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 86#(= ~q2_back~0 ~q2_front~0), 19#$Ultimate##0true, Black: 150#(and (<= (div |thread4Thread1of1ForFork1_~cond~3#1| 256) 0) (<= 1 |thread4Thread1of1ForFork1_~cond~3#1|)), Black: 90#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 37#L111true, Black: 99#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3#L52true, Black: 461#(<= ~q2_front~0 ~q2_back~0), 53#L145true, Black: 742#(and (<= ~q2_front~0 ~q2_back~0) (<= 1 (mod |thread4Thread1of1ForFork1_~cond~3#1| 256))), Black: 109#(and (= ~i~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 750#(<= ~q1_front~0 ~q1_back~0), Black: 440#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= (+ ~i~0 1) ~N~0)), Black: 442#(and (or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0)) (<= ~i~0 0) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)) (<= (+ ~i~0 1) ~N~0)), Black: 322#(or (< ~q2_back~0 (+ 1 ~q2_front~0)) (< ~q2_front~0 0) (= (mod |thread4Thread1of1ForFork1_~cond~3#1| 256) 0))]) [2024-06-27 18:03:29,824 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-06-27 18:03:29,824 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-27 18:03:29,824 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 18:03:29,824 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-27 18:03:31,430 INFO L124 PetriNetUnfolderBase]: 11903/19014 cut-off events. [2024-06-27 18:03:31,430 INFO L125 PetriNetUnfolderBase]: For 98162/99254 co-relation queries the response was YES. [2024-06-27 18:03:31,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77310 conditions, 19014 events. 11903/19014 cut-off events. For 98162/99254 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 139331 event pairs, 3562 based on Foata normal form. 776/19223 useless extension candidates. Maximal degree in co-relation 77268. Up to 11476 conditions per place. [2024-06-27 18:03:31,655 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 137 selfloop transitions, 12 changer transitions 0/179 dead transitions. [2024-06-27 18:03:31,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 179 transitions, 1575 flow [2024-06-27 18:03:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 18:03:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 18:03:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2024-06-27 18:03:31,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6053268765133172 [2024-06-27 18:03:31,657 INFO L175 Difference]: Start difference. First operand has 100 places, 105 transitions, 686 flow. Second operand 7 states and 250 transitions. [2024-06-27 18:03:31,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 179 transitions, 1575 flow [2024-06-27 18:03:31,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 179 transitions, 1562 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-27 18:03:31,957 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 765 flow [2024-06-27 18:03:31,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=765, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2024-06-27 18:03:31,958 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 47 predicate places. [2024-06-27 18:03:31,958 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 765 flow [2024-06-27 18:03:31,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:03:31,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 18:03:31,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 18:03:31,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 18:03:31,959 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-27 18:03:31,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 18:03:31,959 INFO L85 PathProgramCache]: Analyzing trace with hash -32317917, now seen corresponding path program 1 times [2024-06-27 18:03:31,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 18:03:31,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238631210] [2024-06-27 18:03:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:31,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 18:03:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:03:33,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 18:03:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238631210] [2024-06-27 18:03:33,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238631210] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 18:03:33,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183561755] [2024-06-27 18:03:33,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 18:03:33,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 18:03:33,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 18:03:33,930 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 18:03:33,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 18:03:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 18:03:34,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 54 conjunts are in the unsatisfiable core [2024-06-27 18:03:34,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 18:03:34,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-06-27 18:03:34,124 INFO L378 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 [2024-06-27 18:03:34,180 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-06-27 18:03:34,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-06-27 18:03:34,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-06-27 18:03:34,267 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-27 18:03:34,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-06-27 18:03:34,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-06-27 18:03:35,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:35,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 46 [2024-06-27 18:03:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 18:03:35,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 18:03:36,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:36,180 INFO L378 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 133 treesize of output 97 [2024-06-27 18:03:36,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:36,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 654 treesize of output 666 [2024-06-27 18:03:36,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:36,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 574 treesize of output 622 [2024-06-27 18:03:36,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 18:03:36,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 406 treesize of output 426 [2024-06-27 18:05:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 18:05:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183561755] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 18:05:43,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 18:05:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31 [2024-06-27 18:05:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740141096] [2024-06-27 18:05:43,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 18:05:43,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-06-27 18:05:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 18:05:43,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-06-27 18:05:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=847, Unknown=14, NotChecked=0, Total=992 [2024-06-27 18:05:45,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 59 [2024-06-27 18:05:45,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 765 flow. Second operand has 32 states, 32 states have (on average 17.4375) internal successors, (558), 32 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 18:05:45,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 18:05:45,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 59 [2024-06-27 18:05:45,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 18:05:57,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 18:06:01,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 18:06:06,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 18:06:10,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 18:06:25,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 18:06:30,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 18:06:35,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-27 18:06:47,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]