./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp1x3.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-exp1x3.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-exp1x3.wvr.c ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/bench-exp1x3.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:23,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:28:23,142 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:23,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:28:23,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:28:23,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:28:23,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:28:23,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:28:23,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:28:23,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:28:23,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:28:23,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:28:23,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:28:23,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:28:23,170 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:28:23,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:28:23,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:28:23,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:28:23,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:28:23,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:28:23,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:28:23,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:28:23,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:28:23,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:28:23,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:28:23,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:28:23,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:28:23,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:28:23,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:28:23,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:28:23,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:28:23,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:28:23,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:23,176 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:28:23,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:28:23,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:28:23,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:28:23,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:28:23,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:28:23,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:28:23,177 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:28:23,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:28:23,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:28:23,178 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:23,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:28:23,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:28:23,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:28:23,397 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:28:23,399 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:28:23,400 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-exp1x3.wvr.yml/witness.yml [2024-02-07 14:28:23,498 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:28:23,498 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:28:23,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-02-07 14:28:24,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:28:24,632 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:28:24,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-02-07 14:28:24,638 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cebc398f/97b3b1218be54d9c86947543f2f4b387/FLAG1e5085641 [2024-02-07 14:28:24,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cebc398f/97b3b1218be54d9c86947543f2f4b387 [2024-02-07 14:28:24,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:28:24,651 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:28:24,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:24,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:28:24,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:28:24,657 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:23" (1/2) ... [2024-02-07 14:28:24,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b4c987 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:24, skipping insertion in model container [2024-02-07 14:28:24,658 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:23" (1/2) ... [2024-02-07 14:28:24,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1fbaa5e4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:28:24, skipping insertion in model container [2024-02-07 14:28:24,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:24" (2/2) ... [2024-02-07 14:28:24,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50b4c987 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24, skipping insertion in model container [2024-02-07 14:28:24,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:28:24" (2/2) ... [2024-02-07 14:28:24,660 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:28:24,672 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:28:24,673 INFO L76 edCorrectnessWitness]: Location invariant before [L57-L57] ((((0LL - (long long )x1) + (long long )x2 >= 0LL) && ((long long )x1 + (long long )x2 >= 0LL)) && ((0LL - (long long )x1) - (long long )x2 >= 0LL)) && ((long long )x1 - (long long )x2 >= 0LL) [2024-02-07 14:28:24,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:28:24,801 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-exp1x3.wvr.c[1875,1888] [2024-02-07 14:28:24,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:24,811 INFO L203 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 14:28:24,847 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-exp1x3.wvr.c[1875,1888] [2024-02-07 14:28:24,860 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:28:24,872 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:28:24,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24 WrapperNode [2024-02-07 14:28:24,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:28:24,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:24,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:28:24,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:28:24,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,916 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-02-07 14:28:24,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:28:24,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:28:24,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:28:24,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:28:24,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,958 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-07 14:28:24,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:28:24,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:28:24,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:28:24,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:28:24,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (1/1) ... [2024-02-07 14:28:24,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:28:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:25,040 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:25,072 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:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:28:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-07 14:28:25,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-07 14:28:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-07 14:28:25,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-07 14:28:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:28:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:28:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:28:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:28:25,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:28:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:28:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:28:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:28:25,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:28:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:28:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:28:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:28:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:28:25,090 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:25,186 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:28:25,188 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:28:25,374 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:28:25,374 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:28:25,449 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:28:25,449 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-07 14:28:25,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:25 BoogieIcfgContainer [2024-02-07 14:28:25,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:28:25,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:28:25,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:28:25,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:28:25,454 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:23" (1/4) ... [2024-02-07 14:28:25,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2300aa88 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:28:25, skipping insertion in model container [2024-02-07 14:28:25,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:28:24" (2/4) ... [2024-02-07 14:28:25,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2300aa88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:25, skipping insertion in model container [2024-02-07 14:28:25,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:28:24" (3/4) ... [2024-02-07 14:28:25,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2300aa88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:28:25, skipping insertion in model container [2024-02-07 14:28:25,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:28:25" (4/4) ... [2024-02-07 14:28:25,456 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2024-02-07 14:28:25,473 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:28:25,473 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-02-07 14:28:25,473 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:28:25,500 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 14:28:25,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 56 flow [2024-02-07 14:28:25,546 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2024-02-07 14:28:25,547 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 14:28:25,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 2/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-02-07 14:28:25,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 21 transitions, 56 flow [2024-02-07 14:28:25,554 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 48 flow [2024-02-07 14:28:25,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:28:25,565 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;@b8b0a21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:28:25,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-07 14:28:25,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:28:25,567 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-07 14:28:25,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 14:28:25,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:25,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-07 14:28:25,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:28:25,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:25,573 INFO L85 PathProgramCache]: Analyzing trace with hash 6909, now seen corresponding path program 1 times [2024-02-07 14:28:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:25,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011813300] [2024-02-07 14:28:25,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:25,849 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:25,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011813300] [2024-02-07 14:28:25,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011813300] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:25,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:25,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:28:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156296893] [2024-02-07 14:28:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:25,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:25,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:25,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:28:25,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:25,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:25,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:28:25,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:25,925 INFO L124 PetriNetUnfolderBase]: 44/79 cut-off events. [2024-02-07 14:28:25,925 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-07 14:28:25,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 79 events. 44/79 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 169 event pairs, 18 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 120. Up to 74 conditions per place. [2024-02-07 14:28:25,927 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 12 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2024-02-07 14:28:25,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 17 transitions, 74 flow [2024-02-07 14:28:25,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2024-02-07 14:28:25,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-02-07 14:28:25,938 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 48 flow. Second operand 3 states and 30 transitions. [2024-02-07 14:28:25,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 17 transitions, 74 flow [2024-02-07 14:28:25,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 17 transitions, 66 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-07 14:28:25,941 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 42 flow [2024-02-07 14:28:25,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=20, PETRI_TRANSITIONS=17} [2024-02-07 14:28:25,945 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -3 predicate places. [2024-02-07 14:28:25,945 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 42 flow [2024-02-07 14:28:25,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:25,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:25,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:25,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:28:25,946 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:28:25,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:25,946 INFO L85 PathProgramCache]: Analyzing trace with hash -463628136, now seen corresponding path program 1 times [2024-02-07 14:28:25,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:25,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467878504] [2024-02-07 14:28:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:25,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:26,087 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:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467878504] [2024-02-07 14:28:26,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467878504] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:26,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:26,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:28:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937104954] [2024-02-07 14:28:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:26,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:28:26,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:26,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:28:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:28:26,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2024-02-07 14:28:26,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:26,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:26,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2024-02-07 14:28:26,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:26,202 INFO L124 PetriNetUnfolderBase]: 65/116 cut-off events. [2024-02-07 14:28:26,202 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 14:28:26,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 116 events. 65/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 310 event pairs, 9 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 229. Up to 85 conditions per place. [2024-02-07 14:28:26,216 INFO L140 encePairwiseOnDemand]: 17/21 looper letters, 20 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2024-02-07 14:28:26,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 27 transitions, 113 flow [2024-02-07 14:28:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:28:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:28:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2024-02-07 14:28:26,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6825396825396826 [2024-02-07 14:28:26,218 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 42 flow. Second operand 3 states and 43 transitions. [2024-02-07 14:28:26,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 27 transitions, 113 flow [2024-02-07 14:28:26,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 27 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:26,219 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 57 flow [2024-02-07 14:28:26,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2024-02-07 14:28:26,219 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -2 predicate places. [2024-02-07 14:28:26,220 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 57 flow [2024-02-07 14:28:26,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:26,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:26,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:26,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:28:26,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:28:26,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1914090899, now seen corresponding path program 1 times [2024-02-07 14:28:26,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:26,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505785468] [2024-02-07 14:28:26,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:26,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505785468] [2024-02-07 14:28:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505785468] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:26,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:26,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:26,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322058857] [2024-02-07 14:28:26,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:26,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:26,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:26,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2024-02-07 14:28:26,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 57 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:26,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:26,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2024-02-07 14:28:26,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:26,433 INFO L124 PetriNetUnfolderBase]: 63/113 cut-off events. [2024-02-07 14:28:26,434 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-02-07 14:28:26,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 113 events. 63/113 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 288 event pairs, 2 based on Foata normal form. 2/115 useless extension candidates. Maximal degree in co-relation 72. Up to 45 conditions per place. [2024-02-07 14:28:26,436 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 24 selfloop transitions, 7 changer transitions 4/38 dead transitions. [2024-02-07 14:28:26,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 38 transitions, 175 flow [2024-02-07 14:28:26,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2024-02-07 14:28:26,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-02-07 14:28:26,439 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 57 flow. Second operand 5 states and 66 transitions. [2024-02-07 14:28:26,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 38 transitions, 175 flow [2024-02-07 14:28:26,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 38 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:28:26,442 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 80 flow [2024-02-07 14:28:26,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2024-02-07 14:28:26,444 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-02-07 14:28:26,444 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 80 flow [2024-02-07 14:28:26,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:26,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:26,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:26,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:28:26,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:28:26,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1002745910, now seen corresponding path program 1 times [2024-02-07 14:28:26,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:26,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132975709] [2024-02-07 14:28:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:26,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:26,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132975709] [2024-02-07 14:28:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132975709] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:28:26,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:28:26,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:28:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66220876] [2024-02-07 14:28:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:28:26,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:28:26,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:28:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:28:26,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2024-02-07 14:28:26,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:26,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:26,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2024-02-07 14:28:26,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:26,675 INFO L124 PetriNetUnfolderBase]: 56/104 cut-off events. [2024-02-07 14:28:26,676 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-02-07 14:28:26,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 104 events. 56/104 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 255 event pairs, 2 based on Foata normal form. 4/108 useless extension candidates. Maximal degree in co-relation 79. Up to 50 conditions per place. [2024-02-07 14:28:26,677 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 19 selfloop transitions, 5 changer transitions 8/35 dead transitions. [2024-02-07 14:28:26,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 179 flow [2024-02-07 14:28:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:28:26,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:28:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2024-02-07 14:28:26,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-07 14:28:26,681 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 80 flow. Second operand 5 states and 63 transitions. [2024-02-07 14:28:26,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 179 flow [2024-02-07 14:28:26,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 173 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:26,683 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 74 flow [2024-02-07 14:28:26,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2024-02-07 14:28:26,684 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 4 predicate places. [2024-02-07 14:28:26,685 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 74 flow [2024-02-07 14:28:26,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:26,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:26,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:26,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 14:28:26,686 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:28:26,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:26,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1364905705, now seen corresponding path program 2 times [2024-02-07 14:28:26,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:26,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352462689] [2024-02-07 14:28:26,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:26,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:26,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352462689] [2024-02-07 14:28:26,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352462689] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:26,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898930058] [2024-02-07 14:28:26,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:28:26,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:26,789 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:26,804 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:26,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:28:26,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:28:26,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:26,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:26,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:27,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898930058] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:27,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:27,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:28:27,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560752184] [2024-02-07 14:28:27,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:27,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:28:27,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:28:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:28:27,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2024-02-07 14:28:27,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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:27,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:27,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2024-02-07 14:28:27,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:27,182 INFO L124 PetriNetUnfolderBase]: 44/81 cut-off events. [2024-02-07 14:28:27,182 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-02-07 14:28:27,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 81 events. 44/81 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 159 event pairs, 4 based on Foata normal form. 6/87 useless extension candidates. Maximal degree in co-relation 71. Up to 53 conditions per place. [2024-02-07 14:28:27,186 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 22 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2024-02-07 14:28:27,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 169 flow [2024-02-07 14:28:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:28:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:28:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2024-02-07 14:28:27,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-02-07 14:28:27,189 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 74 flow. Second operand 6 states and 67 transitions. [2024-02-07 14:28:27,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 169 flow [2024-02-07 14:28:27,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 157 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 14:28:27,191 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 101 flow [2024-02-07 14:28:27,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2024-02-07 14:28:27,192 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2024-02-07 14:28:27,193 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 101 flow [2024-02-07 14:28:27,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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:27,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:27,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:27,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 14:28:27,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:27,404 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:28:27,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 154359704, now seen corresponding path program 2 times [2024-02-07 14:28:27,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:27,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314130613] [2024-02-07 14:28:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314130613] [2024-02-07 14:28:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314130613] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742289557] [2024-02-07 14:28:27,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:28:27,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:27,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:27,469 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:28:27,498 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:28:27,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:28:27,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:28:27,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-07 14:28:27,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:27,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:27,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742289557] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:27,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:27,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-02-07 14:28:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417272774] [2024-02-07 14:28:27,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:27,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 14:28:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:27,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 14:28:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-07 14:28:27,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 21 [2024-02-07 14:28:27,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 101 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:27,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:27,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 21 [2024-02-07 14:28:27,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:28:27,754 INFO L124 PetriNetUnfolderBase]: 40/77 cut-off events. [2024-02-07 14:28:27,754 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-02-07 14:28:27,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 77 events. 40/77 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 4 based on Foata normal form. 4/81 useless extension candidates. Maximal degree in co-relation 124. Up to 61 conditions per place. [2024-02-07 14:28:27,755 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 21 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2024-02-07 14:28:27,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 190 flow [2024-02-07 14:28:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 14:28:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 14:28:27,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2024-02-07 14:28:27,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-07 14:28:27,756 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 101 flow. Second operand 6 states and 63 transitions. [2024-02-07 14:28:27,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 190 flow [2024-02-07 14:28:27,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 183 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-02-07 14:28:27,759 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 137 flow [2024-02-07 14:28:27,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2024-02-07 14:28:27,762 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 13 predicate places. [2024-02-07 14:28:27,762 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 137 flow [2024-02-07 14:28:27,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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:27,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:28:27,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:28:27,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-07 14:28:27,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-07 14:28:27,974 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:28:27,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:28:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash 373171239, now seen corresponding path program 1 times [2024-02-07 14:28:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:28:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056704426] [2024-02-07 14:28:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:28:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:28:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056704426] [2024-02-07 14:28:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056704426] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:28:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710330476] [2024-02-07 14:28:28,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:28:28,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:28:28,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:28:28,223 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:28:28,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-07 14:28:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:28:28,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:28:28,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:28:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:41,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:28:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:28:42,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710330476] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:28:42,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:28:42,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-02-07 14:28:42,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629286114] [2024-02-07 14:28:42,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:28:42,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-07 14:28:42,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:28:42,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-07 14:28:42,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=147, Unknown=2, NotChecked=0, Total=210 [2024-02-07 14:28:46,888 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:28:46,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:28:46,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 137 flow. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:28:46,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:28:46,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:29:09,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:29:11,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:29:13,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:29:17,235 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:29:17,335 INFO L124 PetriNetUnfolderBase]: 140/271 cut-off events. [2024-02-07 14:29:17,335 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2024-02-07 14:29:17,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 271 events. 140/271 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 965 event pairs, 4 based on Foata normal form. 7/278 useless extension candidates. Maximal degree in co-relation 575. Up to 91 conditions per place. [2024-02-07 14:29:17,338 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 55 selfloop transitions, 26 changer transitions 17/101 dead transitions. [2024-02-07 14:29:17,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 101 transitions, 693 flow [2024-02-07 14:29:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-07 14:29:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-07 14:29:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2024-02-07 14:29:17,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5787545787545788 [2024-02-07 14:29:17,340 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 137 flow. Second operand 13 states and 158 transitions. [2024-02-07 14:29:17,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 101 transitions, 693 flow [2024-02-07 14:29:17,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 101 transitions, 676 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-02-07 14:29:17,343 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 391 flow [2024-02-07 14:29:17,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=391, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-02-07 14:29:17,343 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 30 predicate places. [2024-02-07 14:29:17,344 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 391 flow [2024-02-07 14:29:17,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 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:17,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:29:17,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:29:17,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-07 14:29:17,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:29:17,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:29:17,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:29:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1965075209, now seen corresponding path program 2 times [2024-02-07 14:29:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:29:17,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082949145] [2024-02-07 14:29:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:29:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:29:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:29:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:29:17,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:29:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082949145] [2024-02-07 14:29:17,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082949145] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:29:17,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464911141] [2024-02-07 14:29:17,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:29:17,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:29:17,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:29:17,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 14:29:17,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-07 14:29:17,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:29:17,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:29:17,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:29:17,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:29:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:29:25,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:29:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:29:25,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464911141] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:29:25,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:29:25,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-02-07 14:29:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412467676] [2024-02-07 14:29:25,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:29:25,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-07 14:29:25,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:29:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-07 14:29:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-02-07 14:29:25,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:29:25,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 391 flow. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:29:25,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:29:25,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:29:25,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:29:27,981 INFO L124 PetriNetUnfolderBase]: 211/405 cut-off events. [2024-02-07 14:29:27,981 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-02-07 14:29:27,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 405 events. 211/405 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1670 event pairs, 26 based on Foata normal form. 5/410 useless extension candidates. Maximal degree in co-relation 2055. Up to 221 conditions per place. [2024-02-07 14:29:27,983 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 71 selfloop transitions, 26 changer transitions 11/111 dead transitions. [2024-02-07 14:29:27,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 1023 flow [2024-02-07 14:29:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-07 14:29:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-07 14:29:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 152 transitions. [2024-02-07 14:29:27,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5567765567765568 [2024-02-07 14:29:27,985 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 391 flow. Second operand 13 states and 152 transitions. [2024-02-07 14:29:27,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 1023 flow [2024-02-07 14:29:27,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 111 transitions, 930 flow, removed 45 selfloop flow, removed 2 redundant places. [2024-02-07 14:29:27,991 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 594 flow [2024-02-07 14:29:27,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=594, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-02-07 14:29:27,992 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 46 predicate places. [2024-02-07 14:29:27,992 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 594 flow [2024-02-07 14:29:27,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 14:29:27,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:29:27,993 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:29:28,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-07 14:29:28,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:29:28,193 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:29:28,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:29:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash 773343567, now seen corresponding path program 3 times [2024-02-07 14:29:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:29:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524480855] [2024-02-07 14:29:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:29:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:29:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:29:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:29:28,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:29:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524480855] [2024-02-07 14:29:28,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524480855] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:29:28,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960757893] [2024-02-07 14:29:28,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:29:28,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:29:28,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:29:28,275 INFO L229 MonitoredProcess]: Starting monitored process 6 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:28,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-07 14:29:28,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 14:29:28,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:29:28,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-07 14:29:28,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:30:03,796 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-07 14:30:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:30:18,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:30:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:30:24,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960757893] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:30:24,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:30:24,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-02-07 14:30:24,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296721722] [2024-02-07 14:30:24,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:30:24,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-07 14:30:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:30:24,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-07 14:30:24,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=145, Unknown=2, NotChecked=0, Total=210 [2024-02-07 14:30:24,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:30:24,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 594 flow. Second operand has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 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:30:24,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:30:24,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:30:24,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:30:28,356 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:30,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:46,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:30:58,017 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:31:02,020 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:31:06,031 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:31:10,051 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:31:15,596 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:31:19,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:31:23,713 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:31:30,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:31:30,587 INFO L124 PetriNetUnfolderBase]: 485/886 cut-off events. [2024-02-07 14:31:30,588 INFO L125 PetriNetUnfolderBase]: For 8393/8393 co-relation queries the response was YES. [2024-02-07 14:31:30,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 886 events. 485/886 cut-off events. For 8393/8393 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4320 event pairs, 6 based on Foata normal form. 29/915 useless extension candidates. Maximal degree in co-relation 4901. Up to 299 conditions per place. [2024-02-07 14:31:30,594 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 125 selfloop transitions, 82 changer transitions 50/260 dead transitions. [2024-02-07 14:31:30,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 260 transitions, 2687 flow [2024-02-07 14:31:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-02-07 14:31:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-02-07 14:31:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 308 transitions. [2024-02-07 14:31:30,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2024-02-07 14:31:30,596 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 594 flow. Second operand 26 states and 308 transitions. [2024-02-07 14:31:30,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 260 transitions, 2687 flow [2024-02-07 14:31:30,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 260 transitions, 2516 flow, removed 84 selfloop flow, removed 2 redundant places. [2024-02-07 14:31:30,613 INFO L231 Difference]: Finished difference. Result has 99 places, 130 transitions, 1322 flow [2024-02-07 14:31:30,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1322, PETRI_PLACES=99, PETRI_TRANSITIONS=130} [2024-02-07 14:31:30,614 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 76 predicate places. [2024-02-07 14:31:30,614 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 130 transitions, 1322 flow [2024-02-07 14:31:30,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 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:31:30,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:30,615 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:31:30,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-07 14:31:30,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:30,820 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:31:30,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1687675681, now seen corresponding path program 4 times [2024-02-07 14:31:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:30,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332837694] [2024-02-07 14:31:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:30,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332837694] [2024-02-07 14:31:30,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332837694] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:31:30,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130950851] [2024-02-07 14:31:30,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-07 14:31:30,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:30,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:31:30,912 INFO L229 MonitoredProcess]: Starting monitored process 7 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:31:30,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-07 14:31:31,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-07 14:31:31,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:31:31,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-07 14:31:31,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:31:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:32,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:31:32,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:32,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130950851] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:31:32,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:31:32,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-02-07 14:31:32,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511525913] [2024-02-07 14:31:32,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:31:32,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-07 14:31:32,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:32,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-07 14:31:32,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-02-07 14:31:32,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:31:32,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 130 transitions, 1322 flow. Second operand has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 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:31:32,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:32,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:31:32,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:32,890 INFO L124 PetriNetUnfolderBase]: 362/693 cut-off events. [2024-02-07 14:31:32,890 INFO L125 PetriNetUnfolderBase]: For 8649/8649 co-relation queries the response was YES. [2024-02-07 14:31:32,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4113 conditions, 693 events. 362/693 cut-off events. For 8649/8649 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3266 event pairs, 34 based on Foata normal form. 18/711 useless extension candidates. Maximal degree in co-relation 3987. Up to 502 conditions per place. [2024-02-07 14:31:32,895 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 114 selfloop transitions, 38 changer transitions 1/156 dead transitions. [2024-02-07 14:31:32,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 156 transitions, 1721 flow [2024-02-07 14:31:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 14:31:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 14:31:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-02-07 14:31:32,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2024-02-07 14:31:32,896 INFO L175 Difference]: Start difference. First operand has 99 places, 130 transitions, 1322 flow. Second operand 12 states and 122 transitions. [2024-02-07 14:31:32,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 156 transitions, 1721 flow [2024-02-07 14:31:32,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 156 transitions, 1384 flow, removed 127 selfloop flow, removed 14 redundant places. [2024-02-07 14:31:32,914 INFO L231 Difference]: Finished difference. Result has 96 places, 128 transitions, 1085 flow [2024-02-07 14:31:32,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1085, PETRI_PLACES=96, PETRI_TRANSITIONS=128} [2024-02-07 14:31:32,914 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 73 predicate places. [2024-02-07 14:31:32,915 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 128 transitions, 1085 flow [2024-02-07 14:31:32,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.533333333333333) internal successors, (113), 15 states have internal predecessors, (113), 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:31:32,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:32,915 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:31:32,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-07 14:31:33,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:33,128 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:31:33,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash -33293236, now seen corresponding path program 5 times [2024-02-07 14:31:33,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:33,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803439098] [2024-02-07 14:31:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:33,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:33,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803439098] [2024-02-07 14:31:33,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803439098] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:31:33,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835400522] [2024-02-07 14:31:33,225 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-07 14:31:33,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:31:33,236 INFO L229 MonitoredProcess]: Starting monitored process 8 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:31:33,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-07 14:31:33,383 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:31:33,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:31:33,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-07 14:31:33,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:31:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:34,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:31:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:34,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835400522] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:31:34,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:31:34,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-02-07 14:31:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789952053] [2024-02-07 14:31:34,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:31:34,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-07 14:31:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:31:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-07 14:31:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-02-07 14:31:34,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:31:34,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 128 transitions, 1085 flow. Second operand has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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:31:34,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:31:34,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:31:34,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:31:37,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:31:37,328 INFO L124 PetriNetUnfolderBase]: 427/827 cut-off events. [2024-02-07 14:31:37,328 INFO L125 PetriNetUnfolderBase]: For 10090/10090 co-relation queries the response was YES. [2024-02-07 14:31:37,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4629 conditions, 827 events. 427/827 cut-off events. For 10090/10090 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4151 event pairs, 34 based on Foata normal form. 19/844 useless extension candidates. Maximal degree in co-relation 4288. Up to 383 conditions per place. [2024-02-07 14:31:37,334 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 150 selfloop transitions, 34 changer transitions 20/207 dead transitions. [2024-02-07 14:31:37,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 207 transitions, 2233 flow [2024-02-07 14:31:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 14:31:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 14:31:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2024-02-07 14:31:37,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-07 14:31:37,341 INFO L175 Difference]: Start difference. First operand has 96 places, 128 transitions, 1085 flow. Second operand 12 states and 126 transitions. [2024-02-07 14:31:37,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 207 transitions, 2233 flow [2024-02-07 14:31:37,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 207 transitions, 2127 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-02-07 14:31:37,361 INFO L231 Difference]: Finished difference. Result has 105 places, 147 transitions, 1310 flow [2024-02-07 14:31:37,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1310, PETRI_PLACES=105, PETRI_TRANSITIONS=147} [2024-02-07 14:31:37,362 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 82 predicate places. [2024-02-07 14:31:37,362 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 147 transitions, 1310 flow [2024-02-07 14:31:37,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 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:31:37,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:31:37,363 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:31:37,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-07 14:31:37,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:37,578 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:31:37,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:31:37,578 INFO L85 PathProgramCache]: Analyzing trace with hash 135696064, now seen corresponding path program 6 times [2024-02-07 14:31:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:31:37,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410544998] [2024-02-07 14:31:37,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:31:37,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:31:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:31:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:31:37,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:31:37,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410544998] [2024-02-07 14:31:37,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410544998] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:31:37,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407087570] [2024-02-07 14:31:37,649 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-07 14:31:37,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:31:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:31:37,651 INFO L229 MonitoredProcess]: Starting monitored process 9 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:31:37,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-07 14:31:38,057 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-07 14:31:38,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:31:38,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-07 14:31:38,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:32:10,801 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-07 14:32:16,160 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-07 14:32:32,174 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-07 14:32:40,188 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~x1~0 2))) (let ((.cse1 (mod c_~n~0 4294967296)) (.cse2 (mod (* 4294967295 (div (* (- 1) .cse0) 2)) 4294967296))) (and (= (mod .cse0 2) 0) (= (mod c_~x2~0 2) 0) (<= (+ (mod .cse0 4294967296) 1) .cse1) (= (mod c_~x1~0 2) 0) (<= .cse1 (mod c_~x2~0 4294967296)) (<= 1 .cse2) (= (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296) .cse2)))) is different from false [2024-02-07 14:33:00,219 WARN L293 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-07 14:33:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-02-07 14:33:09,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:33:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:33:29,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407087570] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:33:29,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:33:29,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 16 [2024-02-07 14:33:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480295513] [2024-02-07 14:33:29,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:33:29,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-07 14:33:29,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:33:29,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-07 14:33:29,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=155, Unknown=9, NotChecked=26, Total=240 [2024-02-07 14:33:29,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:33:29,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 147 transitions, 1310 flow. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 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:33:29,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:33:29,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:33:29,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:33:39,765 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:44,009 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:45,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:34:07,003 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 38 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:34:11,210 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,213 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,536 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,538 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,541 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:31,544 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:37,205 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:50,446 WARN L293 SmtUtils]: Spent 9.60s on a formula simplification. DAG size of input: 43 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:34:55,361 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,363 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:04,085 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:08,088 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:12,091 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:16,094 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:20,182 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:35:22,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:26,506 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:35:29,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:35:29,033 INFO L124 PetriNetUnfolderBase]: 575/1132 cut-off events. [2024-02-07 14:35:29,034 INFO L125 PetriNetUnfolderBase]: For 14489/14489 co-relation queries the response was YES. [2024-02-07 14:35:29,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 1132 events. 575/1132 cut-off events. For 14489/14489 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6057 event pairs, 48 based on Foata normal form. 27/1157 useless extension candidates. Maximal degree in co-relation 6412. Up to 568 conditions per place. [2024-02-07 14:35:29,043 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 161 selfloop transitions, 81 changer transitions 22/267 dead transitions. [2024-02-07 14:35:29,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 267 transitions, 2916 flow [2024-02-07 14:35:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-07 14:35:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-07 14:35:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 219 transitions. [2024-02-07 14:35:29,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5488721804511278 [2024-02-07 14:35:29,045 INFO L175 Difference]: Start difference. First operand has 105 places, 147 transitions, 1310 flow. Second operand 19 states and 219 transitions. [2024-02-07 14:35:29,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 267 transitions, 2916 flow [2024-02-07 14:35:29,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 267 transitions, 2800 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-02-07 14:35:29,070 INFO L231 Difference]: Finished difference. Result has 126 places, 188 transitions, 2129 flow [2024-02-07 14:35:29,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2129, PETRI_PLACES=126, PETRI_TRANSITIONS=188} [2024-02-07 14:35:29,071 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 103 predicate places. [2024-02-07 14:35:29,071 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 188 transitions, 2129 flow [2024-02-07 14:35:29,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 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:35:29,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:35:29,071 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:35:29,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-07 14:35:29,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-02-07 14:35:29,285 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:35:29,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:35:29,285 INFO L85 PathProgramCache]: Analyzing trace with hash -275750850, now seen corresponding path program 7 times [2024-02-07 14:35:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:35:29,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510992112] [2024-02-07 14:35:29,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:35:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:35:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:35:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:35:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:35:29,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510992112] [2024-02-07 14:35:29,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510992112] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:35:29,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687232463] [2024-02-07 14:35:29,931 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-07 14:35:29,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:35:29,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:35:29,932 INFO L229 MonitoredProcess]: Starting monitored process 10 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:35:29,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-07 14:35:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:35:30,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-07 14:35:30,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:35:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:35:51,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:36:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:36:04,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687232463] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:36:04,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:36:04,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-02-07 14:36:04,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060785463] [2024-02-07 14:36:04,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:36:04,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-07 14:36:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:36:04,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-07 14:36:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=328, Unknown=4, NotChecked=0, Total=420 [2024-02-07 14:36:09,020 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:09,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:36:09,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 188 transitions, 2129 flow. Second operand has 21 states, 21 states have (on average 6.857142857142857) internal successors, (144), 21 states have internal predecessors, (144), 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:36:09,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:36:09,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:36:09,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:36:30,610 WARN L293 SmtUtils]: Spent 16.61s on a formula simplification. DAG size of input: 72 DAG size of output: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:36:34,952 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:36:48,232 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 86 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:36:57,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:04,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:25,218 WARN L293 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 86 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:37:32,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:37,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:43,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:37:47,441 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:53,203 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:57,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:00,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:02,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:38:02,394 INFO L124 PetriNetUnfolderBase]: 619/1249 cut-off events. [2024-02-07 14:38:02,394 INFO L125 PetriNetUnfolderBase]: For 22529/22529 co-relation queries the response was YES. [2024-02-07 14:38:02,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8352 conditions, 1249 events. 619/1249 cut-off events. For 22529/22529 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7189 event pairs, 18 based on Foata normal form. 7/1254 useless extension candidates. Maximal degree in co-relation 8095. Up to 460 conditions per place. [2024-02-07 14:38:02,403 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 199 selfloop transitions, 91 changer transitions 30/323 dead transitions. [2024-02-07 14:38:02,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 323 transitions, 4264 flow [2024-02-07 14:38:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-02-07 14:38:02,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-02-07 14:38:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions. [2024-02-07 14:38:02,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123809523809524 [2024-02-07 14:38:02,406 INFO L175 Difference]: Start difference. First operand has 126 places, 188 transitions, 2129 flow. Second operand 25 states and 269 transitions. [2024-02-07 14:38:02,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 323 transitions, 4264 flow [2024-02-07 14:38:02,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 323 transitions, 3834 flow, removed 205 selfloop flow, removed 8 redundant places. [2024-02-07 14:38:02,445 INFO L231 Difference]: Finished difference. Result has 150 places, 222 transitions, 2644 flow [2024-02-07 14:38:02,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1825, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2644, PETRI_PLACES=150, PETRI_TRANSITIONS=222} [2024-02-07 14:38:02,445 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 127 predicate places. [2024-02-07 14:38:02,445 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 222 transitions, 2644 flow [2024-02-07 14:38:02,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.857142857142857) internal successors, (144), 21 states have internal predecessors, (144), 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:38:02,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:38:02,446 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:38:02,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-07 14:38:02,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-02-07 14:38:02,654 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:38:02,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:38:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1162280752, now seen corresponding path program 8 times [2024-02-07 14:38:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:38:02,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169254195] [2024-02-07 14:38:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:38:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:38:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:38:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:38:05,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:38:05,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169254195] [2024-02-07 14:38:05,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169254195] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:38:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398761607] [2024-02-07 14:38:05,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-07 14:38:05,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:38:05,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:38:05,761 INFO L229 MonitoredProcess]: Starting monitored process 11 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:38:05,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-07 14:38:06,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-07 14:38:06,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:38:06,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-07 14:38:06,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:38:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:38:27,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:38:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:38:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398761607] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:38:30,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:38:30,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2024-02-07 14:38:30,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779636972] [2024-02-07 14:38:30,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:38:30,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-07 14:38:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:38:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-07 14:38:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=280, Unknown=4, NotChecked=0, Total=342 [2024-02-07 14:38:33,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:38:33,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 222 transitions, 2644 flow. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 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:38:33,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:38:33,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:38:33,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:38:52,930 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 89 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:38:58,820 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:22,247 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 93 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:39:27,507 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:31,731 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:53,039 WARN L293 SmtUtils]: Spent 13.75s on a formula simplification. DAG size of input: 85 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:39:57,855 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:01,858 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:06,701 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:10,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:11,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:45,554 WARN L293 SmtUtils]: Spent 24.99s on a formula simplification. DAG size of input: 103 DAG size of output: 90 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:40:49,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:52,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:40:57,917 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:01,930 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:04,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:05,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:10,231 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:17,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:41:17,683 INFO L124 PetriNetUnfolderBase]: 754/1559 cut-off events. [2024-02-07 14:41:17,683 INFO L125 PetriNetUnfolderBase]: For 34657/34657 co-relation queries the response was YES. [2024-02-07 14:41:17,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11354 conditions, 1559 events. 754/1559 cut-off events. For 34657/34657 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9727 event pairs, 86 based on Foata normal form. 5/1564 useless extension candidates. Maximal degree in co-relation 10941. Up to 1045 conditions per place. [2024-02-07 14:41:17,695 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 245 selfloop transitions, 95 changer transitions 10/353 dead transitions. [2024-02-07 14:41:17,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 353 transitions, 5037 flow [2024-02-07 14:41:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-07 14:41:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-07 14:41:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 222 transitions. [2024-02-07 14:41:17,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.556390977443609 [2024-02-07 14:41:17,696 INFO L175 Difference]: Start difference. First operand has 150 places, 222 transitions, 2644 flow. Second operand 19 states and 222 transitions. [2024-02-07 14:41:17,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 353 transitions, 5037 flow [2024-02-07 14:41:17,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 353 transitions, 4633 flow, removed 184 selfloop flow, removed 7 redundant places. [2024-02-07 14:41:17,772 INFO L231 Difference]: Finished difference. Result has 167 places, 268 transitions, 3402 flow [2024-02-07 14:41:17,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3402, PETRI_PLACES=167, PETRI_TRANSITIONS=268} [2024-02-07 14:41:17,773 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 144 predicate places. [2024-02-07 14:41:17,773 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 268 transitions, 3402 flow [2024-02-07 14:41:17,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 states have internal predecessors, (132), 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:41:17,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:41:17,774 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:41:17,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-02-07 14:41:17,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-07 14:41:17,984 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-07 14:41:17,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:41:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1438024764, now seen corresponding path program 9 times [2024-02-07 14:41:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:41:17,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238925553] [2024-02-07 14:41:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:41:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:41:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:41:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:41:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:41:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238925553] [2024-02-07 14:41:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238925553] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:41:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687033898] [2024-02-07 14:41:18,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-07 14:41:18,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:41:18,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:41:18,614 INFO L229 MonitoredProcess]: Starting monitored process 12 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:41:18,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-07 14:41:19,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-07 14:41:19,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-07 14:41:19,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-07 14:41:19,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:41:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:41:53,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:41:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 14:41:56,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687033898] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:41:56,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:41:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-02-07 14:41:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401640672] [2024-02-07 14:41:56,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:41:56,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-07 14:41:56,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:41:56,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-07 14:41:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=323, Unknown=4, NotChecked=0, Total=420 [2024-02-07 14:42:01,026 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:01,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-07 14:42:01,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 268 transitions, 3402 flow. Second operand has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 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:42:01,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:42:01,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-07 14:42:01,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:42:20,027 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification. DAG size of input: 72 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:42:22,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:25,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:29,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-07 14:42:55,380 WARN L293 SmtUtils]: Spent 17.37s on a formula simplification. DAG size of input: 88 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-07 14:43:00,248 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:43:01,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15