./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp3x3-opt.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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/bench-exp3x3-opt.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp3x3-opt.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-dev-958ec4d-m [2024-02-07 14:28:29,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:28:29,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:28:29,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:28:29,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:28:29,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:28:29,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:28:29,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:28:29,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:28:29,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:28:29,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:28:29,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:28:29,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:28:29,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:28:29,284 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:28:29,284 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:28:29,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:28:29,285 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:28:29,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:28:29,285 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:28:29,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:28:29,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:28:29,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:28:29,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:28:29,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:28:29,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:28:29,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:28:29,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:28:29,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:28:29,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:28:29,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:28:29,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:28:29,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:29,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:28:29,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:28:29,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:28:29,291 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:28:29,291 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:28:29,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:28:29,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:28:29,292 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:28:29,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:28:29,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:28:29,292 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-02-07 14:28:29,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:28:29,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:28:29,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:28:29,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:28:29,529 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:28:29,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-02-07 14:28:30,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:28:30,852 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:28:30,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-02-07 14:28:30,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0f08770/d72f92624c6346efbc4609442bc5f1fc/FLAG0678a6ddf [2024-02-07 14:28:30,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b0f08770/d72f92624c6346efbc4609442bc5f1fc [2024-02-07 14:28:30,879 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:28:30,880 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:28:30,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp3x3-opt.wvr.yml/witness.yml [2024-02-07 14:28:30,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:28:30,943 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:28:30,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:30,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:28:30,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:28:30,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:30" (1/2) ... [2024-02-07 14:28:30,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52db34b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:30, skipping insertion in model container [2024-02-07 14:28:30,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:30" (1/2) ... [2024-02-07 14:28:30,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@9feebcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:30, skipping insertion in model container [2024-02-07 14:28:30,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:30" (2/2) ... [2024-02-07 14:28:30,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52db34b6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:30, skipping insertion in model container [2024-02-07 14:28:30,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:30" (2/2) ... [2024-02-07 14:28:30,952 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:28:30,969 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:28:30,970 INFO L76 edCorrectnessWitness]: Location invariant before [L92-L92] ((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((0LL - (long long )n) - (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL) [2024-02-07 14:28:30,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:28:31,120 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c[2904,2917] [2024-02-07 14:28:31,124 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:31,134 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:28:31,173 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c[2904,2917] [2024-02-07 14:28:31,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:31,187 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:28:31,188 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31 WrapperNode [2024-02-07 14:28:31,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:31,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:31,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:28:31,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:28:31,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,221 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-02-07 14:28:31,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:31,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:28:31,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:28:31,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:28:31,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,261 INFO L175 MemorySlicer]: Split 14 memory accesses to 7 slices as follows [2, 2, 2, 2, 2, 2, 2]. 14 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 1, 1, 1, 1]. [2024-02-07 14:28:31,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,289 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:28:31,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:28:31,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:28:31,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:28:31,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (1/1) ... [2024-02-07 14:28:31,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:31,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:31,335 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-02-07 14:28:31,337 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-02-07 14:28:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:28:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:28:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:28:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:28:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:28:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:28:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:28:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-02-07 14:28:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-02-07 14:28:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:28:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:28:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:28:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:28:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:28:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-02-07 14:28:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-02-07 14:28:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:28:31,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:28:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:28:31,384 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:28:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-07 14:28:31,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-07 14:28:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-07 14:28:31,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-07 14:28:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:28:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:28:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:28:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:28:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:28:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-02-07 14:28:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-02-07 14:28:31,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-02-07 14:28:31,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-02-07 14:28:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-02-07 14:28:31,387 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-02-07 14:28:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:28:31,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:28:31,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:28:31,389 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 14:28:31,522 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:28:31,524 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:28:31,789 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:28:31,789 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:28:31,943 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:28:31,943 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-07 14:28:31,943 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:31 BoogieIcfgContainer [2024-02-07 14:28:31,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:28:31,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:28:31,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:28:31,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:28:31,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:28:30" (1/4) ... [2024-02-07 14:28:31,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4464f61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:31, skipping insertion in model container [2024-02-07 14:28:31,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:28:30" (2/4) ... [2024-02-07 14:28:31,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4464f61b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:28:31, skipping insertion in model container [2024-02-07 14:28:31,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:31" (3/4) ... [2024-02-07 14:28:31,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4464f61b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:28:31, skipping insertion in model container [2024-02-07 14:28:31,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:31" (4/4) ... [2024-02-07 14:28:31,952 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-02-07 14:28:31,969 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:28:31,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-07 14:28:31,969 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:28:32,033 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-02-07 14:28:32,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 148 flow [2024-02-07 14:28:32,099 INFO L124 PetriNetUnfolderBase]: 6/47 cut-off events. [2024-02-07 14:28:32,101 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-07 14:28:32,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 47 events. 6/47 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-02-07 14:28:32,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 148 flow [2024-02-07 14:28:32,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 46 transitions, 128 flow [2024-02-07 14:28:32,120 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:28:32,125 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;@52034060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:28:32,125 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-02-07 14:28:32,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:28:32,131 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:28:32,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:28:32,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:32,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:28:32,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:32,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:32,137 INFO L85 PathProgramCache]: Analyzing trace with hash 13952, now seen corresponding path program 1 times [2024-02-07 14:28:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:32,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097720461] [2024-02-07 14:28:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:32,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097720461] [2024-02-07 14:28:32,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097720461] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:32,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:28:32,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3366731] [2024-02-07 14:28:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:32,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:32,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-02-07 14:28:32,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-07 14:28:32,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:32,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-02-07 14:28:32,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:34,136 INFO L124 PetriNetUnfolderBase]: 17592/20507 cut-off events. [2024-02-07 14:28:34,137 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2024-02-07 14:28:34,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41840 conditions, 20507 events. 17592/20507 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 69151 event pairs, 8341 based on Foata normal form. 0/11256 useless extension candidates. Maximal degree in co-relation 31251. Up to 20233 conditions per place. [2024-02-07 14:28:34,260 INFO L140 encePairwiseOnDemand]: 50/53 looper letters, 36 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2024-02-07 14:28:34,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 202 flow [2024-02-07 14:28:34,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-02-07 14:28:34,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49056603773584906 [2024-02-07 14:28:34,271 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 128 flow. Second operand 3 states and 78 transitions. [2024-02-07 14:28:34,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 202 flow [2024-02-07 14:28:34,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-02-07 14:28:34,315 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 106 flow [2024-02-07 14:28:34,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-02-07 14:28:34,319 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -11 predicate places. [2024-02-07 14:28:34,319 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 106 flow [2024-02-07 14:28:34,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-02-07 14:28:34,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:34,320 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] [2024-02-07 14:28:34,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:28:34,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:34,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash 382352880, now seen corresponding path program 1 times [2024-02-07 14:28:34,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:34,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270370931] [2024-02-07 14:28:34,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:34,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270370931] [2024-02-07 14:28:34,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270370931] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:34,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:34,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:28:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892621234] [2024-02-07 14:28:34,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:34,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:34,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:34,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:34,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:34,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:34,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-02-07 14:28:34,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:34,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:34,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:35,790 INFO L124 PetriNetUnfolderBase]: 24281/28220 cut-off events. [2024-02-07 14:28:35,790 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2024-02-07 14:28:35,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56787 conditions, 28220 events. 24281/28220 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 98311 event pairs, 3544 based on Foata normal form. 1/15549 useless extension candidates. Maximal degree in co-relation 56778. Up to 20729 conditions per place. [2024-02-07 14:28:35,999 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 60 selfloop transitions, 3 changer transitions 5/75 dead transitions. [2024-02-07 14:28:36,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 311 flow [2024-02-07 14:28:36,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-02-07 14:28:36,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6981132075471698 [2024-02-07 14:28:36,002 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 106 flow. Second operand 3 states and 111 transitions. [2024-02-07 14:28:36,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 311 flow [2024-02-07 14:28:36,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 307 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:36,004 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 121 flow [2024-02-07 14:28:36,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2024-02-07 14:28:36,004 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2024-02-07 14:28:36,005 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 121 flow [2024-02-07 14:28:36,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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-02-07 14:28:36,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:36,005 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] [2024-02-07 14:28:36,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:28:36,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:36,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:36,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1157773215, now seen corresponding path program 1 times [2024-02-07 14:28:36,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:36,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924210743] [2024-02-07 14:28:36,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-07 14:28:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924210743] [2024-02-07 14:28:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924210743] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:36,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:36,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:28:36,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409940148] [2024-02-07 14:28:36,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:36,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:36,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:36,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:36,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:36,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:36,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-02-07 14:28:36,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:36,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:36,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:37,706 INFO L124 PetriNetUnfolderBase]: 31317/36775 cut-off events. [2024-02-07 14:28:37,707 INFO L125 PetriNetUnfolderBase]: For 6070/6070 co-relation queries the response was YES. [2024-02-07 14:28:37,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81158 conditions, 36775 events. 31317/36775 cut-off events. For 6070/6070 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 138085 event pairs, 5847 based on Foata normal form. 1/26052 useless extension candidates. Maximal degree in co-relation 20631. Up to 24140 conditions per place. [2024-02-07 14:28:37,884 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 64 selfloop transitions, 3 changer transitions 1/75 dead transitions. [2024-02-07 14:28:37,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 75 transitions, 330 flow [2024-02-07 14:28:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-02-07 14:28:37,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2024-02-07 14:28:37,887 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 121 flow. Second operand 3 states and 107 transitions. [2024-02-07 14:28:37,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 75 transitions, 330 flow [2024-02-07 14:28:37,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:37,890 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 137 flow [2024-02-07 14:28:37,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2024-02-07 14:28:37,890 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2024-02-07 14:28:37,891 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 137 flow [2024-02-07 14:28:37,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-02-07 14:28:37,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:37,891 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-02-07 14:28:37,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:28:37,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:37,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash -895727632, now seen corresponding path program 1 times [2024-02-07 14:28:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:37,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916844982] [2024-02-07 14:28:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:37,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:37,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916844982] [2024-02-07 14:28:37,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916844982] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:37,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:28:37,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49262671] [2024-02-07 14:28:37,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:37,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:37,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:37,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 137 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-02-07 14:28:37,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:37,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:37,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:40,530 INFO L124 PetriNetUnfolderBase]: 42553/50136 cut-off events. [2024-02-07 14:28:40,530 INFO L125 PetriNetUnfolderBase]: For 15126/15126 co-relation queries the response was YES. [2024-02-07 14:28:40,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118562 conditions, 50136 events. 42553/50136 cut-off events. For 15126/15126 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 201590 event pairs, 7521 based on Foata normal form. 1/43268 useless extension candidates. Maximal degree in co-relation 37100. Up to 34728 conditions per place. [2024-02-07 14:28:40,730 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 68 selfloop transitions, 3 changer transitions 9/87 dead transitions. [2024-02-07 14:28:40,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 402 flow [2024-02-07 14:28:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-02-07 14:28:40,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7232704402515723 [2024-02-07 14:28:40,732 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 137 flow. Second operand 3 states and 115 transitions. [2024-02-07 14:28:40,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 402 flow [2024-02-07 14:28:40,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:40,736 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 153 flow [2024-02-07 14:28:40,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-02-07 14:28:40,738 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2024-02-07 14:28:40,738 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 153 flow [2024-02-07 14:28:40,739 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-02-07 14:28:40,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:40,739 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-02-07 14:28:40,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:28:40,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:40,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:40,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1887158729, now seen corresponding path program 1 times [2024-02-07 14:28:40,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:40,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160939370] [2024-02-07 14:28:40,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160939370] [2024-02-07 14:28:40,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160939370] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:40,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:40,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211805142] [2024-02-07 14:28:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:40,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:40,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:40,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:40,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:40,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:40,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:43,571 INFO L124 PetriNetUnfolderBase]: 42427/49895 cut-off events. [2024-02-07 14:28:43,572 INFO L125 PetriNetUnfolderBase]: For 19148/19148 co-relation queries the response was YES. [2024-02-07 14:28:43,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123919 conditions, 49895 events. 42427/49895 cut-off events. For 19148/19148 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 198753 event pairs, 1117 based on Foata normal form. 418/50261 useless extension candidates. Maximal degree in co-relation 39904. Up to 18911 conditions per place. [2024-02-07 14:28:43,830 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 112 selfloop transitions, 7 changer transitions 12/138 dead transitions. [2024-02-07 14:28:43,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 138 transitions, 663 flow [2024-02-07 14:28:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:43,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-02-07 14:28:43,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7018867924528301 [2024-02-07 14:28:43,835 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 153 flow. Second operand 5 states and 186 transitions. [2024-02-07 14:28:43,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 138 transitions, 663 flow [2024-02-07 14:28:43,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 138 transitions, 659 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:43,843 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 176 flow [2024-02-07 14:28:43,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-02-07 14:28:43,844 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2024-02-07 14:28:43,845 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 176 flow [2024-02-07 14:28:43,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:43,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:43,845 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-02-07 14:28:43,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:28:43,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:43,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:43,846 INFO L85 PathProgramCache]: Analyzing trace with hash -194230579, now seen corresponding path program 2 times [2024-02-07 14:28:43,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:43,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164822130] [2024-02-07 14:28:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:43,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:43,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:43,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:43,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164822130] [2024-02-07 14:28:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164822130] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965439981] [2024-02-07 14:28:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:43,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:43,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:43,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:43,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:43,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:43,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:46,737 INFO L124 PetriNetUnfolderBase]: 43887/52267 cut-off events. [2024-02-07 14:28:46,737 INFO L125 PetriNetUnfolderBase]: For 30217/30217 co-relation queries the response was YES. [2024-02-07 14:28:46,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138869 conditions, 52267 events. 43887/52267 cut-off events. For 30217/30217 co-relation queries the response was YES. Maximal size of possible extension queue 1760. Compared 222248 event pairs, 6072 based on Foata normal form. 1133/53202 useless extension candidates. Maximal degree in co-relation 45054. Up to 25456 conditions per place. [2024-02-07 14:28:46,922 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 122 selfloop transitions, 6 changer transitions 11/146 dead transitions. [2024-02-07 14:28:46,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 146 transitions, 767 flow [2024-02-07 14:28:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 188 transitions. [2024-02-07 14:28:46,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7094339622641509 [2024-02-07 14:28:46,924 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 176 flow. Second operand 5 states and 188 transitions. [2024-02-07 14:28:46,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 146 transitions, 767 flow [2024-02-07 14:28:46,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 146 transitions, 754 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:46,929 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 209 flow [2024-02-07 14:28:46,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=209, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2024-02-07 14:28:46,930 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 3 predicate places. [2024-02-07 14:28:46,930 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 209 flow [2024-02-07 14:28:46,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:46,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:46,931 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-02-07 14:28:46,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:28:46,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:46,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash -743222354, now seen corresponding path program 1 times [2024-02-07 14:28:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347528508] [2024-02-07 14:28:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:46,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347528508] [2024-02-07 14:28:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347528508] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:47,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863886022] [2024-02-07 14:28:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:47,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:47,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:47,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:47,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:47,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 209 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:47,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:47,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:47,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:49,772 INFO L124 PetriNetUnfolderBase]: 42625/50980 cut-off events. [2024-02-07 14:28:49,772 INFO L125 PetriNetUnfolderBase]: For 51329/51329 co-relation queries the response was YES. [2024-02-07 14:28:49,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152177 conditions, 50980 events. 42625/50980 cut-off events. For 51329/51329 co-relation queries the response was YES. Maximal size of possible extension queue 1742. Compared 221077 event pairs, 6651 based on Foata normal form. 1308/51639 useless extension candidates. Maximal degree in co-relation 66610. Up to 29398 conditions per place. [2024-02-07 14:28:49,997 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 126 selfloop transitions, 7 changer transitions 10/150 dead transitions. [2024-02-07 14:28:49,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 150 transitions, 843 flow [2024-02-07 14:28:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2024-02-07 14:28:49,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7018867924528301 [2024-02-07 14:28:49,999 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 209 flow. Second operand 5 states and 186 transitions. [2024-02-07 14:28:50,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 150 transitions, 843 flow [2024-02-07 14:28:50,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 150 transitions, 826 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:50,023 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 243 flow [2024-02-07 14:28:50,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2024-02-07 14:28:50,024 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2024-02-07 14:28:50,024 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 243 flow [2024-02-07 14:28:50,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:50,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:50,025 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-02-07 14:28:50,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 14:28:50,025 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:50,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:50,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1131503205, now seen corresponding path program 1 times [2024-02-07 14:28:50,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:50,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432466129] [2024-02-07 14:28:50,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:50,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:50,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432466129] [2024-02-07 14:28:50,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432466129] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:50,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:50,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826385082] [2024-02-07 14:28:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:50,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:50,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:50,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:50,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:50,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:50,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:50,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:50,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:52,899 INFO L124 PetriNetUnfolderBase]: 41999/50261 cut-off events. [2024-02-07 14:28:52,899 INFO L125 PetriNetUnfolderBase]: For 59740/59740 co-relation queries the response was YES. [2024-02-07 14:28:53,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162328 conditions, 50261 events. 41999/50261 cut-off events. For 59740/59740 co-relation queries the response was YES. Maximal size of possible extension queue 1730. Compared 219061 event pairs, 1249 based on Foata normal form. 822/51023 useless extension candidates. Maximal degree in co-relation 73856. Up to 21427 conditions per place. [2024-02-07 14:28:53,303 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 99 selfloop transitions, 5 changer transitions 39/150 dead transitions. [2024-02-07 14:28:53,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 150 transitions, 856 flow [2024-02-07 14:28:53,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:53,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2024-02-07 14:28:53,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.690566037735849 [2024-02-07 14:28:53,305 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 243 flow. Second operand 5 states and 183 transitions. [2024-02-07 14:28:53,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 150 transitions, 856 flow [2024-02-07 14:28:53,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 150 transitions, 848 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:53,584 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 234 flow [2024-02-07 14:28:53,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2024-02-07 14:28:53,585 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2024-02-07 14:28:53,585 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 234 flow [2024-02-07 14:28:53,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:53,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:53,585 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-02-07 14:28:53,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:28:53,586 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:53,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash 749106343, now seen corresponding path program 2 times [2024-02-07 14:28:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:53,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481674665] [2024-02-07 14:28:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:53,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:53,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481674665] [2024-02-07 14:28:53,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481674665] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:53,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:53,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422661703] [2024-02-07 14:28:53,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:53,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:53,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:53,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:53,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:53,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:53,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:53,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:53,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:53,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:55,766 INFO L124 PetriNetUnfolderBase]: 31893/37917 cut-off events. [2024-02-07 14:28:55,766 INFO L125 PetriNetUnfolderBase]: For 55521/55521 co-relation queries the response was YES. [2024-02-07 14:28:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126328 conditions, 37917 events. 31893/37917 cut-off events. For 55521/55521 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 151884 event pairs, 749 based on Foata normal form. 426/38292 useless extension candidates. Maximal degree in co-relation 60908. Up to 14817 conditions per place. [2024-02-07 14:28:55,916 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 99 selfloop transitions, 5 changer transitions 39/150 dead transitions. [2024-02-07 14:28:55,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 914 flow [2024-02-07 14:28:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-02-07 14:28:55,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6867924528301886 [2024-02-07 14:28:55,917 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 234 flow. Second operand 5 states and 182 transitions. [2024-02-07 14:28:55,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 914 flow [2024-02-07 14:28:56,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 884 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-02-07 14:28:56,158 INFO L231 Difference]: Finished difference. Result has 71 places, 57 transitions, 237 flow [2024-02-07 14:28:56,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2024-02-07 14:28:56,159 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2024-02-07 14:28:56,159 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 237 flow [2024-02-07 14:28:56,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-07 14:28:56,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:56,159 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-02-07 14:28:56,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 14:28:56,160 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:56,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash -109022071, now seen corresponding path program 3 times [2024-02-07 14:28:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:56,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311516330] [2024-02-07 14:28:56,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:56,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311516330] [2024-02-07 14:28:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311516330] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615316294] [2024-02-07 14:28:56,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:28:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:56,223 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-02-07 14:28:56,238 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-02-07 14:28:56,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 14:28:56,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:28:56,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:56,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:56,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:56,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615316294] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:56,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-02-07 14:28:56,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250385832] [2024-02-07 14:28:56,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:56,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:28:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:28:56,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:28:56,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:56,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-07 14:28:56,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:56,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:56,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:58,147 INFO L124 PetriNetUnfolderBase]: 20863/24699 cut-off events. [2024-02-07 14:28:58,147 INFO L125 PetriNetUnfolderBase]: For 34759/34759 co-relation queries the response was YES. [2024-02-07 14:28:58,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85081 conditions, 24699 events. 20863/24699 cut-off events. For 34759/34759 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 93924 event pairs, 986 based on Foata normal form. 628/25293 useless extension candidates. Maximal degree in co-relation 47087. Up to 19385 conditions per place. [2024-02-07 14:28:58,284 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 122 selfloop transitions, 6 changer transitions 0/135 dead transitions. [2024-02-07 14:28:58,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 135 transitions, 823 flow [2024-02-07 14:28:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:58,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-07 14:28:58,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6377358490566037 [2024-02-07 14:28:58,286 INFO L175 Difference]: Start difference. First operand has 71 places, 57 transitions, 237 flow. Second operand 5 states and 169 transitions. [2024-02-07 14:28:58,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 135 transitions, 823 flow [2024-02-07 14:28:58,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 135 transitions, 808 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:58,347 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 269 flow [2024-02-07 14:28:58,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2024-02-07 14:28:58,347 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2024-02-07 14:28:58,347 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 269 flow [2024-02-07 14:28:58,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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-02-07 14:28:58,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:58,348 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-02-07 14:28:58,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-07 14:28:58,560 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,SelfDestructingSolverStorable9 [2024-02-07 14:28:58,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:28:58,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1229200024, now seen corresponding path program 1 times [2024-02-07 14:28:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:58,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595742513] [2024-02-07 14:28:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-07 14:28:58,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595742513] [2024-02-07 14:28:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595742513] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757910495] [2024-02-07 14:28:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:58,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:58,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:58,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:28:58,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-07 14:28:58,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:58,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:28:58,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:29:00,356 INFO L124 PetriNetUnfolderBase]: 20061/23911 cut-off events. [2024-02-07 14:29:00,356 INFO L125 PetriNetUnfolderBase]: For 44319/44319 co-relation queries the response was YES. [2024-02-07 14:29:00,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87427 conditions, 23911 events. 20061/23911 cut-off events. For 44319/44319 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 91588 event pairs, 769 based on Foata normal form. 804/24670 useless extension candidates. Maximal degree in co-relation 75439. Up to 17269 conditions per place. [2024-02-07 14:29:00,499 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 134 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2024-02-07 14:29:00,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 147 transitions, 996 flow [2024-02-07 14:29:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:29:00,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:29:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-07 14:29:00,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6377358490566037 [2024-02-07 14:29:00,501 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 269 flow. Second operand 5 states and 169 transitions. [2024-02-07 14:29:00,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 147 transitions, 996 flow [2024-02-07 14:29:00,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 147 transitions, 963 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-02-07 14:29:00,628 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 301 flow [2024-02-07 14:29:00,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-02-07 14:29:00,629 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 21 predicate places. [2024-02-07 14:29:00,629 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 301 flow [2024-02-07 14:29:00,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-07 14:29:00,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:29:00,629 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] [2024-02-07 14:29:00,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-07 14:29:00,630 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:29:00,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:29:00,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1143596777, now seen corresponding path program 1 times [2024-02-07 14:29:00,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:29:00,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549815193] [2024-02-07 14:29:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:29:00,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:29:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:29:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-07 14:29:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:29:00,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549815193] [2024-02-07 14:29:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549815193] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:29:00,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:29:00,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:29:00,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422828060] [2024-02-07 14:29:00,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:29:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:29:00,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:29:00,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:29:00,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:29:00,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:29:00,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-07 14:29:00,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:29:00,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:29:00,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:29:02,199 INFO L124 PetriNetUnfolderBase]: 21673/26161 cut-off events. [2024-02-07 14:29:02,199 INFO L125 PetriNetUnfolderBase]: For 78613/78613 co-relation queries the response was YES. [2024-02-07 14:29:02,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103305 conditions, 26161 events. 21673/26161 cut-off events. For 78613/78613 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 104282 event pairs, 3345 based on Foata normal form. 487/26457 useless extension candidates. Maximal degree in co-relation 90432. Up to 10449 conditions per place. [2024-02-07 14:29:02,357 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 162 selfloop transitions, 6 changer transitions 3/178 dead transitions. [2024-02-07 14:29:02,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 178 transitions, 1311 flow [2024-02-07 14:29:02,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:29:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:29:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-02-07 14:29:02,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792452830188679 [2024-02-07 14:29:02,359 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 301 flow. Second operand 5 states and 180 transitions. [2024-02-07 14:29:02,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 178 transitions, 1311 flow [2024-02-07 14:29:02,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 178 transitions, 1278 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-02-07 14:29:02,399 INFO L231 Difference]: Finished difference. Result has 85 places, 66 transitions, 329 flow [2024-02-07 14:29:02,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=85, PETRI_TRANSITIONS=66} [2024-02-07 14:29:02,399 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 26 predicate places. [2024-02-07 14:29:02,399 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 66 transitions, 329 flow [2024-02-07 14:29:02,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-07 14:29:02,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:29:02,400 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] [2024-02-07 14:29:02,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-07 14:29:02,400 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:29:02,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:29:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1482228588, now seen corresponding path program 1 times [2024-02-07 14:29:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:29:02,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88540726] [2024-02-07 14:29:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:29:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:29:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:29:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-07 14:29:02,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:29:02,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88540726] [2024-02-07 14:29:02,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88540726] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:29:02,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:29:02,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:29:02,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610870293] [2024-02-07 14:29:02,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:29:02,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:29:02,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:29:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:29:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:29:02,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:29:02,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 66 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-07 14:29:02,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:29:02,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:29:02,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:29:04,279 INFO L124 PetriNetUnfolderBase]: 21429/25854 cut-off events. [2024-02-07 14:29:04,279 INFO L125 PetriNetUnfolderBase]: For 77866/77866 co-relation queries the response was YES. [2024-02-07 14:29:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109074 conditions, 25854 events. 21429/25854 cut-off events. For 77866/77866 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 100475 event pairs, 994 based on Foata normal form. 244/25943 useless extension candidates. Maximal degree in co-relation 95761. Up to 10326 conditions per place. [2024-02-07 14:29:04,433 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 126 selfloop transitions, 5 changer transitions 44/182 dead transitions. [2024-02-07 14:29:04,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 182 transitions, 1343 flow [2024-02-07 14:29:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:29:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:29:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2024-02-07 14:29:04,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6716981132075471 [2024-02-07 14:29:04,435 INFO L175 Difference]: Start difference. First operand has 85 places, 66 transitions, 329 flow. Second operand 5 states and 178 transitions. [2024-02-07 14:29:04,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 182 transitions, 1343 flow [2024-02-07 14:29:04,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 182 transitions, 1337 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-02-07 14:29:04,597 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 339 flow [2024-02-07 14:29:04,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2024-02-07 14:29:04,598 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places. [2024-02-07 14:29:04,598 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 339 flow [2024-02-07 14:29:04,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-07 14:29:04,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:29:04,598 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] [2024-02-07 14:29:04,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-07 14:29:04,599 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:29:04,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:29:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1802261980, now seen corresponding path program 2 times [2024-02-07 14:29:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:29:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863163896] [2024-02-07 14:29:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:29:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:29:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:29:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-07 14:29:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:29:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863163896] [2024-02-07 14:29:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863163896] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:29:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:29:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:29:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82488776] [2024-02-07 14:29:04,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:29:04,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:29:04,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:29:04,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:29:04,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:29:04,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:29:04,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-07 14:29:04,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:29:04,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:29:04,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:29:05,892 INFO L124 PetriNetUnfolderBase]: 14584/17629 cut-off events. [2024-02-07 14:29:05,893 INFO L125 PetriNetUnfolderBase]: For 52373/52373 co-relation queries the response was YES. [2024-02-07 14:29:05,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77018 conditions, 17629 events. 14584/17629 cut-off events. For 52373/52373 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 65197 event pairs, 996 based on Foata normal form. 484/18030 useless extension candidates. Maximal degree in co-relation 67606. Up to 11829 conditions per place. [2024-02-07 14:29:06,258 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 158 selfloop transitions, 6 changer transitions 0/171 dead transitions. [2024-02-07 14:29:06,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 171 transitions, 1294 flow [2024-02-07 14:29:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:29:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:29:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-02-07 14:29:06,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6377358490566037 [2024-02-07 14:29:06,261 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 339 flow. Second operand 5 states and 169 transitions. [2024-02-07 14:29:06,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 171 transitions, 1294 flow [2024-02-07 14:29:06,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 171 transitions, 1285 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-02-07 14:29:06,336 INFO L231 Difference]: Finished difference. Result has 93 places, 69 transitions, 371 flow [2024-02-07 14:29:06,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=371, PETRI_PLACES=93, PETRI_TRANSITIONS=69} [2024-02-07 14:29:06,337 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2024-02-07 14:29:06,338 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 69 transitions, 371 flow [2024-02-07 14:29:06,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 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-02-07 14:29:06,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:29:06,338 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] [2024-02-07 14:29:06,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-07 14:29:06,339 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-02-07 14:29:06,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:29:06,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1133880147, now seen corresponding path program 1 times [2024-02-07 14:29:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:29:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235821453] [2024-02-07 14:29:06,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:29:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:29:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:29:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-07 14:29:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:29:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235821453] [2024-02-07 14:29:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235821453] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:29:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947991449] [2024-02-07 14:29:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:29:06,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:29:06,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:29:06,834 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-02-07 14:29:06,861 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-02-07 14:29:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:29:07,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:29:07,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:29:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-07 14:29:08,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:29:09,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-07 14:29:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947991449] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:29:09,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:29:09,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2024-02-07 14:29:09,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51843709] [2024-02-07 14:29:09,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:29:09,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-07 14:29:09,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:29:09,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-07 14:29:09,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-02-07 14:29:09,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-02-07 14:29:09,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 69 transitions, 371 flow. Second operand has 18 states, 18 states have (on average 20.22222222222222) internal successors, (364), 18 states have internal predecessors, (364), 0 states have call successors, (0), 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-02-07 14:29:09,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:29:09,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-02-07 14:29:09,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:29:16,127 WARN L293 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:29:30,449 WARN L293 SmtUtils]: Spent 12.91s on a formula simplification. DAG size of input: 52 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:29:41,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:14,660 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:30:16,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:29,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:33,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:37,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:41,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:45,117 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (div c_~x3~0 4294967296)) (.cse9 (div c_~x4~0 4294967296))) (let ((.cse0 (mod c_~x2~0 4294967296)) (.cse1 (mod c_~x1~0 4294967296)) (.cse4 (div c_~n~0 4294967296)) (.cse6 (* .cse9 8589934592)) (.cse7 (* c_~x3~0 2)) (.cse3 (* 2 c_~x4~0)) (.cse5 (* 8589934592 .cse8)) (.cse2 (mod c_~n~0 4294967296))) (and (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse0) (= .cse1 .cse0) (<= .cse2 .cse1) (<= (+ .cse3 2 (* 4294967296 .cse4) .cse5) (+ .cse6 .cse7 c_~n~0)) (<= (+ (* 8589934592 .cse4) .cse6 c_~x1~0 .cse7 2) (+ .cse3 (* 4294967296 (div c_~x1~0 4294967296)) .cse5 (* 2 c_~n~0))) (= (+ (* 4294967296 .cse8) c_~x4~0) (+ c_~x3~0 (* .cse9 4294967296))) (= (mod c_~x1~0 2) 0) (<= 1 .cse2)))) is different from false [2024-02-07 14:30:46,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:55,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:32:59,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:03,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:07,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:11,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:15,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:19,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:33:23,530 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x2~0 4294967296)) (.cse4 (mod c_~x1~0 4294967296)) (.cse5 (mod c_~n~0 4294967296)) (.cse0 (* 4294967296 (div c_~n~0 4294967296))) (.cse1 (* 2 c_~x4~0)) (.cse2 (* (- 2) c_~x4~0))) (and (<= (+ c_~x3~0 2 .cse0) (+ .cse1 (* (div (+ c_~x3~0 .cse2) 4294967296) 4294967296) c_~n~0)) (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse3) (= .cse4 .cse3) (<= .cse5 .cse4) (= (mod c_~x1~0 2) 0) (<= 1 .cse5) (<= (+ c_~x3~0 .cse0) (+ (* 4294967296 (div c_~x3~0 4294967296)) .cse1 (* 4294967296 (div (+ 4294967292 c_~n~0 .cse2) 4294967296)))))) is different from false [2024-02-07 14:33:56,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:00,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:03,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:07,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:11,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:15,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:19,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:23,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:27,626 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* (div c_~x4~0 4294967296) 4294967296))) (let ((.cse3 (mod c_~x2~0 4294967296)) (.cse4 (mod c_~x1~0 4294967296)) (.cse0 (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0)) (.cse1 (+ c_~x3~0 .cse2)) (.cse5 (mod c_~n~0 4294967296))) (and (or (= .cse0 .cse1) (< (+ 3 (* 4294967296 (div c_~n~0 4294967296)) c_~x4~0) (+ c_~n~0 .cse2))) (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse3) (= .cse4 .cse3) (<= .cse5 .cse4) (<= .cse0 .cse1) (= (mod c_~x1~0 2) 0) (<= 1 .cse5)))) is different from false [2024-02-07 14:34:31,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:35,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:39,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:43,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:47,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:51,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:55,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:59,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:03,691 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x2~0 4294967296)) (.cse1 (mod c_~x1~0 4294967296)) (.cse2 (mod c_~n~0 4294967296))) (and (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse0) (= .cse1 .cse0) (<= .cse2 .cse1) (= (mod c_~x1~0 2) 0) (<= 1 .cse2))) is different from false [2024-02-07 14:35:07,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:11,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:15,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:19,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:23,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:27,723 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (div c_~x3~0 4294967296))) (let ((.cse3 (* (div c_~x4~0 4294967296) 4294967296)) (.cse10 (* 4294967296 .cse6)) (.cse11 (* (- 2) c_~x4~0))) (let ((.cse5 (div (+ c_~x3~0 .cse11) 4294967296)) (.cse7 (mod c_~x2~0 4294967296)) (.cse8 (mod c_~x1~0 4294967296)) (.cse0 (+ .cse10 c_~x4~0)) (.cse1 (+ c_~x3~0 .cse3)) (.cse9 (mod c_~n~0 4294967296)) (.cse2 (* 4294967296 (div c_~n~0 4294967296))) (.cse4 (* 2 c_~x4~0))) (and (or (= .cse0 .cse1) (< (+ 3 .cse2 c_~x4~0) (+ c_~n~0 .cse3))) (<= (+ c_~x3~0 2 .cse2) (+ .cse4 (* .cse5 4294967296) c_~n~0)) (<= (+ (* 2147483648 .cse6) 1) (+ (* .cse5 2147483648) c_~x4~0)) (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse7) (= .cse8 .cse7) (<= .cse9 .cse8) (<= .cse0 .cse1) (= (mod c_~x1~0 2) 0) (<= 1 .cse9) (<= (+ c_~x3~0 .cse2) (+ .cse10 .cse4 (* 4294967296 (div (+ 4294967292 c_~n~0 .cse11) 4294967296)))))))) is different from false [2024-02-07 14:36:03,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:07,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:36:28,564 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 [] [2024-02-07 14:37:11,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:15,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:19,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:23,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:27,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:31,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:35,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:39,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:28,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:58,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:39:02,811 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 [] [2024-02-07 14:40:02,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:30,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:34,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:38,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:42,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:46,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:50,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:54,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:58,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:02,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:06,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:10,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:14,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:18,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:22,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:26,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:47,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:35,335 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 [] [2024-02-07 14:42:38,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:42,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:47,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:51,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:55,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:59,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15