./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:09:43,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:09:43,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:09:43,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:09:43,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:09:43,186 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:09:43,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:09:43,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:09:43,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:09:43,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:09:43,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:09:43,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:09:43,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:09:43,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:09:43,194 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:09:43,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:09:43,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:09:43,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:09:43,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:09:43,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:09:43,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:09:43,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:09:43,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:09:43,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:09:43,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:09:43,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:09:43,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:09:43,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:09:43,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:09:43,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:09:43,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:09:43,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:09:43,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:09:43,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:09:43,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:09:43,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:09:43,200 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:09:43,200 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:09:43,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:09:43,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:09:43,201 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:09:43,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:09:43,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:09:43,201 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4cca88acec68e5dbb90cd5700ef248bb5273dc097847f9475a683bfbdc7b189 [2024-06-27 17:09:43,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:09:43,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:09:43,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:09:43,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:09:43,435 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:09:43,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-06-27 17:09:44,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:09:44,676 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:09:44,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-06-27 17:09:44,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2416b143b/764c33d3e1fc41f2895ca018da3ee04d/FLAG8e7b579e5 [2024-06-27 17:09:44,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2416b143b/764c33d3e1fc41f2895ca018da3ee04d [2024-06-27 17:09:44,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:09:44,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:09:44,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:09:44,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:09:44,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:09:44,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:44,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f0a8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44, skipping insertion in model container [2024-06-27 17:09:44,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:44,727 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:09:44,882 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-06-27 17:09:44,888 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:09:44,894 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:09:44,909 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2024-06-27 17:09:44,928 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:09:44,942 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:09:44,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44 WrapperNode [2024-06-27 17:09:44,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:09:44,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:09:44,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:09:44,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:09:44,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:44,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:44,981 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 137 [2024-06-27 17:09:44,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:09:44,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:09:44,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:09:44,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:09:44,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:44,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:44,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,007 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:09:45,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:09:45,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:09:45,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:09:45,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:09:45,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (1/1) ... [2024-06-27 17:09:45,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:09:45,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:45,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:09:45,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:09:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:09:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:09:45,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:09:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:09:45,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:09:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:09:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:09:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:09:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:09:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:09:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:09:45,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:09:45,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:09:45,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:09:45,119 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:09:45,215 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:09:45,216 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:09:45,387 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:09:45,387 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:09:45,626 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:09:45,627 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:09:45,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:09:45 BoogieIcfgContainer [2024-06-27 17:09:45,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:09:45,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:09:45,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:09:45,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:09:45,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:09:44" (1/3) ... [2024-06-27 17:09:45,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c2d990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:09:45, skipping insertion in model container [2024-06-27 17:09:45,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:09:44" (2/3) ... [2024-06-27 17:09:45,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c2d990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:09:45, skipping insertion in model container [2024-06-27 17:09:45,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:09:45" (3/3) ... [2024-06-27 17:09:45,635 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-06-27 17:09:45,641 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:09:45,648 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:09:45,648 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:09:45,648 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:09:45,684 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:09:45,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:09:45,725 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-06-27 17:09:45,725 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:09:45,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 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/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-06-27 17:09:45,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:09:45,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-06-27 17:09:45,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:09:45,740 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@51f67ff7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:09:45,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:09:45,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:09:45,747 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-06-27 17:09:45,747 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:09:45,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:45,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:45,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:45,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 475305122, now seen corresponding path program 1 times [2024-06-27 17:09:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:45,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274722150] [2024-06-27 17:09:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:09:46,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:46,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274722150] [2024-06-27 17:09:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274722150] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:46,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:09:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333172662] [2024-06-27 17:09:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:46,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:09:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:09:46,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:09:46,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:46,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:46,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:46,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:46,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:46,269 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2024-06-27 17:09:46,270 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-27 17:09:46,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2024-06-27 17:09:46,274 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-06-27 17:09:46,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2024-06-27 17:09:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:09:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:09:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-06-27 17:09:46,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:09:46,288 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2024-06-27 17:09:46,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2024-06-27 17:09:46,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:09:46,293 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2024-06-27 17:09:46,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2024-06-27 17:09:46,300 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-06-27 17:09:46,301 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2024-06-27 17:09:46,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:46,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:46,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:46,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:09:46,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:46,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash 213829483, now seen corresponding path program 1 times [2024-06-27 17:09:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467453077] [2024-06-27 17:09:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:46,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:46,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467453077] [2024-06-27 17:09:46,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467453077] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:46,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:46,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:09:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166949414] [2024-06-27 17:09:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:46,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:09:46,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:46,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:09:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:09:46,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:46,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:46,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:46,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:46,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:46,565 INFO L124 PetriNetUnfolderBase]: 69/126 cut-off events. [2024-06-27 17:09:46,565 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-06-27 17:09:46,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 126 events. 69/126 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 321 event pairs, 22 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 255. Up to 72 conditions per place. [2024-06-27 17:09:46,567 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 24 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2024-06-27 17:09:46,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 29 transitions, 131 flow [2024-06-27 17:09:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:09:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:09:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2024-06-27 17:09:46,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-06-27 17:09:46,570 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 3 states and 37 transitions. [2024-06-27 17:09:46,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 29 transitions, 131 flow [2024-06-27 17:09:46,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 29 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:46,571 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 65 flow [2024-06-27 17:09:46,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2024-06-27 17:09:46,573 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2024-06-27 17:09:46,573 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 65 flow [2024-06-27 17:09:46,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:46,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:46,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:46,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:09:46,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:46,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -2060278534, now seen corresponding path program 1 times [2024-06-27 17:09:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339785445] [2024-06-27 17:09:46,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:46,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:46,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339785445] [2024-06-27 17:09:46,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339785445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:46,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:46,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:09:46,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132310819] [2024-06-27 17:09:46,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:46,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:09:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:46,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:09:46,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:09:46,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:46,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06-27 17:09:46,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:46,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:46,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:46,938 INFO L124 PetriNetUnfolderBase]: 86/167 cut-off events. [2024-06-27 17:09:46,938 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-27 17:09:46,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 167 events. 86/167 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 536 event pairs, 24 based on Foata normal form. 11/177 useless extension candidates. Maximal degree in co-relation 385. Up to 83 conditions per place. [2024-06-27 17:09:46,941 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 7 changer transitions 10/47 dead transitions. [2024-06-27 17:09:46,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 47 transitions, 232 flow [2024-06-27 17:09:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:09:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:09:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2024-06-27 17:09:46,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 17:09:46,943 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 65 flow. Second operand 6 states and 63 transitions. [2024-06-27 17:09:46,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 47 transitions, 232 flow [2024-06-27 17:09:46,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 47 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:46,947 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 122 flow [2024-06-27 17:09:46,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2024-06-27 17:09:46,949 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2024-06-27 17:09:46,949 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 122 flow [2024-06-27 17:09:46,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06-27 17:09:46,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:46,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:46,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:09:46,950 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:46,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:46,950 INFO L85 PathProgramCache]: Analyzing trace with hash -246905110, now seen corresponding path program 2 times [2024-06-27 17:09:46,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466156759] [2024-06-27 17:09:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466156759] [2024-06-27 17:09:47,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466156759] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:47,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944989302] [2024-06-27 17:09:47,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:09:47,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:47,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:47,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:47,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:09:47,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:09:47,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:09:47,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:09:47,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:47,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944989302] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:47,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:09:47,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2024-06-27 17:09:47,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739971675] [2024-06-27 17:09:47,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:47,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:09:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:09:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:09:47,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:47,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:47,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:47,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:47,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:47,359 INFO L124 PetriNetUnfolderBase]: 84/161 cut-off events. [2024-06-27 17:09:47,359 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-06-27 17:09:47,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 161 events. 84/161 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 477 event pairs, 21 based on Foata normal form. 5/165 useless extension candidates. Maximal degree in co-relation 525. Up to 95 conditions per place. [2024-06-27 17:09:47,363 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 29 selfloop transitions, 6 changer transitions 3/39 dead transitions. [2024-06-27 17:09:47,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 255 flow [2024-06-27 17:09:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:09:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:09:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2024-06-27 17:09:47,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-06-27 17:09:47,365 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 122 flow. Second operand 4 states and 45 transitions. [2024-06-27 17:09:47,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 255 flow [2024-06-27 17:09:47,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 240 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 17:09:47,368 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 146 flow [2024-06-27 17:09:47,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-06-27 17:09:47,369 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2024-06-27 17:09:47,369 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 146 flow [2024-06-27 17:09:47,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:47,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:47,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:47,383 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-06-27 17:09:47,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:47,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:47,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:47,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1782267732, now seen corresponding path program 3 times [2024-06-27 17:09:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722722545] [2024-06-27 17:09:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:47,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722722545] [2024-06-27 17:09:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722722545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:47,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:47,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:09:47,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303170555] [2024-06-27 17:09:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:47,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:09:47,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:47,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:09:47,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:09:47,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:47,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06-27 17:09:47,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:47,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:47,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:47,761 INFO L124 PetriNetUnfolderBase]: 99/191 cut-off events. [2024-06-27 17:09:47,761 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-06-27 17:09:47,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 191 events. 99/191 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 583 event pairs, 36 based on Foata normal form. 2/192 useless extension candidates. Maximal degree in co-relation 662. Up to 118 conditions per place. [2024-06-27 17:09:47,767 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 28 selfloop transitions, 10 changer transitions 7/46 dead transitions. [2024-06-27 17:09:47,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 330 flow [2024-06-27 17:09:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2024-06-27 17:09:47,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-06-27 17:09:47,769 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 146 flow. Second operand 5 states and 51 transitions. [2024-06-27 17:09:47,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 330 flow [2024-06-27 17:09:47,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 320 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:47,773 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 210 flow [2024-06-27 17:09:47,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2024-06-27 17:09:47,774 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2024-06-27 17:09:47,774 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 210 flow [2024-06-27 17:09:47,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06-27 17:09:47,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:47,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:47,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:09:47,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:47,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash 782854917, now seen corresponding path program 1 times [2024-06-27 17:09:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223208758] [2024-06-27 17:09:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:47,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:47,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223208758] [2024-06-27 17:09:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223208758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:47,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:47,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:09:47,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157610071] [2024-06-27 17:09:47,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:47,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:09:47,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:47,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:09:47,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:09:47,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:47,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:47,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:47,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:47,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:47,923 INFO L124 PetriNetUnfolderBase]: 97/184 cut-off events. [2024-06-27 17:09:47,923 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2024-06-27 17:09:47,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 184 events. 97/184 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 532 event pairs, 26 based on Foata normal form. 4/187 useless extension candidates. Maximal degree in co-relation 743. Up to 133 conditions per place. [2024-06-27 17:09:47,925 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 31 selfloop transitions, 8 changer transitions 2/42 dead transitions. [2024-06-27 17:09:47,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 348 flow [2024-06-27 17:09:47,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:09:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:09:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2024-06-27 17:09:47,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-06-27 17:09:47,926 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 210 flow. Second operand 4 states and 43 transitions. [2024-06-27 17:09:47,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 348 flow [2024-06-27 17:09:47,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 328 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 17:09:47,929 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 232 flow [2024-06-27 17:09:47,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2024-06-27 17:09:47,929 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2024-06-27 17:09:47,929 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 232 flow [2024-06-27 17:09:47,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:47,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:47,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:47,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:09:47,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:47,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:47,931 INFO L85 PathProgramCache]: Analyzing trace with hash 430438170, now seen corresponding path program 4 times [2024-06-27 17:09:47,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:47,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521921570] [2024-06-27 17:09:47,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:47,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:48,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521921570] [2024-06-27 17:09:48,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521921570] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700526392] [2024-06-27 17:09:48,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:09:48,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:48,015 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:48,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 17:09:48,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:09:48,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:09:48,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:09:48,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700526392] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:09:48,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:09:48,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2024-06-27 17:09:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13449346] [2024-06-27 17:09:48,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:09:48,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:09:48,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:48,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:09:48,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:09:48,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:48,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:48,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:48,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:48,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:48,253 INFO L124 PetriNetUnfolderBase]: 111/208 cut-off events. [2024-06-27 17:09:48,253 INFO L125 PetriNetUnfolderBase]: For 558/558 co-relation queries the response was YES. [2024-06-27 17:09:48,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 208 events. 111/208 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 665 event pairs, 25 based on Foata normal form. 5/212 useless extension candidates. Maximal degree in co-relation 851. Up to 115 conditions per place. [2024-06-27 17:09:48,255 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 39 selfloop transitions, 17 changer transitions 0/57 dead transitions. [2024-06-27 17:09:48,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 454 flow [2024-06-27 17:09:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:09:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:09:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2024-06-27 17:09:48,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-27 17:09:48,257 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 232 flow. Second operand 7 states and 69 transitions. [2024-06-27 17:09:48,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 454 flow [2024-06-27 17:09:48,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:09:48,260 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 296 flow [2024-06-27 17:09:48,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2024-06-27 17:09:48,260 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 26 predicate places. [2024-06-27 17:09:48,260 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 296 flow [2024-06-27 17:09:48,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:48,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:48,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:48,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-27 17:09:48,471 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,SelfDestructingSolverStorable6 [2024-06-27 17:09:48,472 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:48,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash -573043247, now seen corresponding path program 2 times [2024-06-27 17:09:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839227035] [2024-06-27 17:09:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:48,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839227035] [2024-06-27 17:09:48,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839227035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:48,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:48,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:09:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883429650] [2024-06-27 17:09:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:48,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:09:48,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:48,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:09:48,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:09:48,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:48,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:48,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:48,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:48,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:48,579 INFO L124 PetriNetUnfolderBase]: 112/204 cut-off events. [2024-06-27 17:09:48,579 INFO L125 PetriNetUnfolderBase]: For 738/738 co-relation queries the response was YES. [2024-06-27 17:09:48,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 204 events. 112/204 cut-off events. For 738/738 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 621 event pairs, 38 based on Foata normal form. 4/207 useless extension candidates. Maximal degree in co-relation 968. Up to 153 conditions per place. [2024-06-27 17:09:48,597 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 31 selfloop transitions, 12 changer transitions 2/46 dead transitions. [2024-06-27 17:09:48,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 448 flow [2024-06-27 17:09:48,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:09:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:09:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2024-06-27 17:09:48,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 17:09:48,598 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 296 flow. Second operand 4 states and 42 transitions. [2024-06-27 17:09:48,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 448 flow [2024-06-27 17:09:48,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 425 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 17:09:48,601 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 321 flow [2024-06-27 17:09:48,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2024-06-27 17:09:48,602 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2024-06-27 17:09:48,602 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 321 flow [2024-06-27 17:09:48,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:48,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:48,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:48,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:09:48,603 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:48,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:48,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1800701758, now seen corresponding path program 5 times [2024-06-27 17:09:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:48,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022959383] [2024-06-27 17:09:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:48,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:48,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022959383] [2024-06-27 17:09:48,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022959383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:09:48,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:09:48,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:09:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362875640] [2024-06-27 17:09:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:09:48,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:09:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:48,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:09:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:09:48,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:48,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06-27 17:09:48,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:48,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:48,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:48,767 INFO L124 PetriNetUnfolderBase]: 105/192 cut-off events. [2024-06-27 17:09:48,768 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2024-06-27 17:09:48,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 192 events. 105/192 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 556 event pairs, 29 based on Foata normal form. 4/195 useless extension candidates. Maximal degree in co-relation 937. Up to 127 conditions per place. [2024-06-27 17:09:48,769 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 35 selfloop transitions, 11 changer transitions 2/49 dead transitions. [2024-06-27 17:09:48,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 477 flow [2024-06-27 17:09:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-06-27 17:09:48,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-27 17:09:48,771 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 321 flow. Second operand 5 states and 47 transitions. [2024-06-27 17:09:48,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 477 flow [2024-06-27 17:09:48,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 463 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 17:09:48,775 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 360 flow [2024-06-27 17:09:48,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=360, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2024-06-27 17:09:48,776 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2024-06-27 17:09:48,777 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 360 flow [2024-06-27 17:09:48,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 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-06-27 17:09:48,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:48,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:48,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:09:48,777 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:48,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1001446796, now seen corresponding path program 6 times [2024-06-27 17:09:48,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:48,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162822348] [2024-06-27 17:09:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:48,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162822348] [2024-06-27 17:09:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162822348] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:48,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949875437] [2024-06-27 17:09:48,854 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:09:48,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:48,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:48,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:48,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 17:09:48,919 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 17:09:48,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:09:48,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:09:48,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949875437] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:09:48,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:09:48,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-06-27 17:09:48,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200427675] [2024-06-27 17:09:48,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:09:48,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 17:09:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:09:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 17:09:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-06-27 17:09:48,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:09:48,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 360 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:48,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:09:48,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:09:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:09:49,052 INFO L124 PetriNetUnfolderBase]: 99/176 cut-off events. [2024-06-27 17:09:49,052 INFO L125 PetriNetUnfolderBase]: For 970/970 co-relation queries the response was YES. [2024-06-27 17:09:49,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 176 events. 99/176 cut-off events. For 970/970 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 484 event pairs, 29 based on Foata normal form. 5/180 useless extension candidates. Maximal degree in co-relation 941. Up to 127 conditions per place. [2024-06-27 17:09:49,054 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 30 selfloop transitions, 14 changer transitions 1/46 dead transitions. [2024-06-27 17:09:49,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 484 flow [2024-06-27 17:09:49,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:09:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:09:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-06-27 17:09:49,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-27 17:09:49,055 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 360 flow. Second operand 5 states and 47 transitions. [2024-06-27 17:09:49,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 484 flow [2024-06-27 17:09:49,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 460 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 17:09:49,059 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 352 flow [2024-06-27 17:09:49,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2024-06-27 17:09:49,059 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2024-06-27 17:09:49,059 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 352 flow [2024-06-27 17:09:49,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:09:49,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:09:49,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:09:49,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-27 17:09:49,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:49,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:09:49,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:09:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1907636546, now seen corresponding path program 1 times [2024-06-27 17:09:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:09:49,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267152440] [2024-06-27 17:09:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:09:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:49,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:09:49,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:09:49,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267152440] [2024-06-27 17:09:49,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267152440] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:09:49,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812917453] [2024-06-27 17:09:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:09:49,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:09:49,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:09:49,532 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:09:49,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 17:09:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:09:49,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 26 conjunts are in the unsatisfiable core [2024-06-27 17:09:49,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:09:49,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:09:49,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:09:49,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2024-06-27 17:09:49,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:09:49,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:09:50,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 116 [2024-06-27 17:09:50,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:09:50,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 490 treesize of output 454 [2024-06-27 17:10:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812917453] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:15,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 17 [2024-06-27 17:10:15,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822419706] [2024-06-27 17:10:15,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:15,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 17:10:15,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:15,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 17:10:15,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-06-27 17:10:15,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:15,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 352 flow. Second operand has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:15,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:15,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:15,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:16,790 INFO L124 PetriNetUnfolderBase]: 309/550 cut-off events. [2024-06-27 17:10:16,790 INFO L125 PetriNetUnfolderBase]: For 2395/2395 co-relation queries the response was YES. [2024-06-27 17:10:16,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2871 conditions, 550 events. 309/550 cut-off events. For 2395/2395 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2362 event pairs, 11 based on Foata normal form. 8/556 useless extension candidates. Maximal degree in co-relation 2536. Up to 245 conditions per place. [2024-06-27 17:10:16,795 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 56 selfloop transitions, 27 changer transitions 88/172 dead transitions. [2024-06-27 17:10:16,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 172 transitions, 1695 flow [2024-06-27 17:10:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-06-27 17:10:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2024-06-27 17:10:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 232 transitions. [2024-06-27 17:10:16,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-27 17:10:16,797 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 352 flow. Second operand 29 states and 232 transitions. [2024-06-27 17:10:16,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 172 transitions, 1695 flow [2024-06-27 17:10:16,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 172 transitions, 1533 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 17:10:16,806 INFO L231 Difference]: Finished difference. Result has 89 places, 49 transitions, 553 flow [2024-06-27 17:10:16,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=553, PETRI_PLACES=89, PETRI_TRANSITIONS=49} [2024-06-27 17:10:16,806 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 68 predicate places. [2024-06-27 17:10:16,806 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 49 transitions, 553 flow [2024-06-27 17:10:16,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.588235294117647) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:16,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:16,807 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:16,821 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-06-27 17:10:17,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:17,018 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:17,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1931788703, now seen corresponding path program 2 times [2024-06-27 17:10:17,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:17,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606834700] [2024-06-27 17:10:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:10:17,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606834700] [2024-06-27 17:10:17,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606834700] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:17,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783384542] [2024-06-27 17:10:17,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:10:17,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:17,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:17,460 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-06-27 17:10:17,461 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-06-27 17:10:17,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:10:17,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:10:17,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2024-06-27 17:10:17,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:17,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:10:17,715 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-06-27 17:10:17,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2024-06-27 17:10:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:17,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:17,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 150 [2024-06-27 17:10:18,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:10:18,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 682 treesize of output 526 [2024-06-27 17:10:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783384542] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:38,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-06-27 17:10:38,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987365433] [2024-06-27 17:10:38,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:38,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 17:10:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 17:10:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-06-27 17:10:38,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:38,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 49 transitions, 553 flow. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:38,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:38,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:38,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:40,469 INFO L124 PetriNetUnfolderBase]: 290/510 cut-off events. [2024-06-27 17:10:40,469 INFO L125 PetriNetUnfolderBase]: For 3633/3633 co-relation queries the response was YES. [2024-06-27 17:10:40,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 510 events. 290/510 cut-off events. For 3633/3633 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2031 event pairs, 11 based on Foata normal form. 37/547 useless extension candidates. Maximal degree in co-relation 3348. Up to 242 conditions per place. [2024-06-27 17:10:40,474 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 78 selfloop transitions, 57 changer transitions 1/137 dead transitions. [2024-06-27 17:10:40,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 1618 flow [2024-06-27 17:10:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:10:40,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:10:40,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 180 transitions. [2024-06-27 17:10:40,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-27 17:10:40,475 INFO L175 Difference]: Start difference. First operand has 89 places, 49 transitions, 553 flow. Second operand 22 states and 180 transitions. [2024-06-27 17:10:40,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 1618 flow [2024-06-27 17:10:40,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 137 transitions, 1352 flow, removed 106 selfloop flow, removed 15 redundant places. [2024-06-27 17:10:40,485 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 979 flow [2024-06-27 17:10:40,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=979, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2024-06-27 17:10:40,486 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2024-06-27 17:10:40,486 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 979 flow [2024-06-27 17:10:40,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:40,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:40,486 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:40,500 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-06-27 17:10:40,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-06-27 17:10:40,700 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:40,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1178291748, now seen corresponding path program 3 times [2024-06-27 17:10:40,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:40,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874363287] [2024-06-27 17:10:40,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:10:40,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:40,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874363287] [2024-06-27 17:10:40,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874363287] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:40,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495357736] [2024-06-27 17:10:40,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:10:40,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:40,855 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-06-27 17:10:40,856 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-06-27 17:10:40,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:10:40,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:10:40,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:10:40,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:10:41,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:10:41,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495357736] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:41,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:41,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-06-27 17:10:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403407493] [2024-06-27 17:10:41,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:41,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:10:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:41,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:10:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:10:41,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:41,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 979 flow. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:41,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:41,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:41,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:43,487 INFO L124 PetriNetUnfolderBase]: 401/698 cut-off events. [2024-06-27 17:10:43,487 INFO L125 PetriNetUnfolderBase]: For 4716/4716 co-relation queries the response was YES. [2024-06-27 17:10:43,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 698 events. 401/698 cut-off events. For 4716/4716 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2915 event pairs, 26 based on Foata normal form. 72/770 useless extension candidates. Maximal degree in co-relation 4239. Up to 359 conditions per place. [2024-06-27 17:10:43,493 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 118 selfloop transitions, 44 changer transitions 0/163 dead transitions. [2024-06-27 17:10:43,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 163 transitions, 2152 flow [2024-06-27 17:10:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 17:10:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 17:10:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2024-06-27 17:10:43,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-06-27 17:10:43,494 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 979 flow. Second operand 11 states and 108 transitions. [2024-06-27 17:10:43,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 163 transitions, 2152 flow [2024-06-27 17:10:43,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 1984 flow, removed 53 selfloop flow, removed 9 redundant places. [2024-06-27 17:10:43,505 INFO L231 Difference]: Finished difference. Result has 88 places, 93 transitions, 1105 flow [2024-06-27 17:10:43,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1105, PETRI_PLACES=88, PETRI_TRANSITIONS=93} [2024-06-27 17:10:43,505 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 67 predicate places. [2024-06-27 17:10:43,505 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 93 transitions, 1105 flow [2024-06-27 17:10:43,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:43,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:43,506 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:43,527 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-06-27 17:10:43,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:43,717 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:43,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1831800103, now seen corresponding path program 4 times [2024-06-27 17:10:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:43,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340239861] [2024-06-27 17:10:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:44,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340239861] [2024-06-27 17:10:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340239861] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:44,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965895244] [2024-06-27 17:10:44,841 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:10:44,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:44,842 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-06-27 17:10:44,843 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-06-27 17:10:44,899 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:10:44,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:10:44,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-27 17:10:44,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:45,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:10:45,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2024-06-27 17:10:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:45,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:45,180 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2024-06-27 17:10:45,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2024-06-27 17:10:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:10:45,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965895244] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:45,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 17 [2024-06-27 17:10:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280997960] [2024-06-27 17:10:45,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:45,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 17:10:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:45,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 17:10:45,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-06-27 17:10:45,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:45,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 93 transitions, 1105 flow. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:45,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:45,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:45,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:45,996 INFO L124 PetriNetUnfolderBase]: 707/1244 cut-off events. [2024-06-27 17:10:45,996 INFO L125 PetriNetUnfolderBase]: For 10727/10727 co-relation queries the response was YES. [2024-06-27 17:10:45,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8481 conditions, 1244 events. 707/1244 cut-off events. For 10727/10727 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5664 event pairs, 67 based on Foata normal form. 4/1248 useless extension candidates. Maximal degree in co-relation 8436. Up to 614 conditions per place. [2024-06-27 17:10:46,006 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 121 selfloop transitions, 89 changer transitions 2/213 dead transitions. [2024-06-27 17:10:46,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 213 transitions, 2817 flow [2024-06-27 17:10:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-27 17:10:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-27 17:10:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 180 transitions. [2024-06-27 17:10:46,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:10:46,008 INFO L175 Difference]: Start difference. First operand has 88 places, 93 transitions, 1105 flow. Second operand 20 states and 180 transitions. [2024-06-27 17:10:46,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 213 transitions, 2817 flow [2024-06-27 17:10:46,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 213 transitions, 2616 flow, removed 74 selfloop flow, removed 4 redundant places. [2024-06-27 17:10:46,030 INFO L231 Difference]: Finished difference. Result has 108 places, 143 transitions, 2009 flow [2024-06-27 17:10:46,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1023, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2009, PETRI_PLACES=108, PETRI_TRANSITIONS=143} [2024-06-27 17:10:46,032 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 87 predicate places. [2024-06-27 17:10:46,032 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 143 transitions, 2009 flow [2024-06-27 17:10:46,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:46,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:46,032 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:46,056 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-06-27 17:10:46,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:46,246 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:46,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1041346613, now seen corresponding path program 5 times [2024-06-27 17:10:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:46,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467214880] [2024-06-27 17:10:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:46,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:47,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:47,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467214880] [2024-06-27 17:10:47,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467214880] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:47,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793396065] [2024-06-27 17:10:47,042 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:10:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:47,043 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-06-27 17:10:47,044 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-06-27 17:10:47,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 17:10:47,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:10:47,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-27 17:10:47,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:47,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:10:47,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2024-06-27 17:10:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:47,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:47,435 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2024-06-27 17:10:47,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2024-06-27 17:10:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:10:47,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793396065] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:47,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 18 [2024-06-27 17:10:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345426281] [2024-06-27 17:10:47,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:47,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 17:10:47,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 17:10:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2024-06-27 17:10:47,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:47,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 143 transitions, 2009 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:47,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:47,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:47,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:48,323 INFO L124 PetriNetUnfolderBase]: 985/1738 cut-off events. [2024-06-27 17:10:48,324 INFO L125 PetriNetUnfolderBase]: For 15621/15621 co-relation queries the response was YES. [2024-06-27 17:10:48,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12175 conditions, 1738 events. 985/1738 cut-off events. For 15621/15621 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8711 event pairs, 132 based on Foata normal form. 3/1741 useless extension candidates. Maximal degree in co-relation 12122. Up to 1141 conditions per place. [2024-06-27 17:10:48,339 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 154 selfloop transitions, 85 changer transitions 1/241 dead transitions. [2024-06-27 17:10:48,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 241 transitions, 3551 flow [2024-06-27 17:10:48,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:10:48,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:10:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 155 transitions. [2024-06-27 17:10:48,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-27 17:10:48,341 INFO L175 Difference]: Start difference. First operand has 108 places, 143 transitions, 2009 flow. Second operand 18 states and 155 transitions. [2024-06-27 17:10:48,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 241 transitions, 3551 flow [2024-06-27 17:10:48,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 241 transitions, 3114 flow, removed 200 selfloop flow, removed 7 redundant places. [2024-06-27 17:10:48,380 INFO L231 Difference]: Finished difference. Result has 122 places, 187 transitions, 2559 flow [2024-06-27 17:10:48,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1656, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2559, PETRI_PLACES=122, PETRI_TRANSITIONS=187} [2024-06-27 17:10:48,381 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 101 predicate places. [2024-06-27 17:10:48,381 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 187 transitions, 2559 flow [2024-06-27 17:10:48,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:48,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:48,383 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:48,394 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-06-27 17:10:48,594 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,SelfDestructingSolverStorable14 [2024-06-27 17:10:48,594 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:48,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash -725556751, now seen corresponding path program 6 times [2024-06-27 17:10:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:48,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323680210] [2024-06-27 17:10:48,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323680210] [2024-06-27 17:10:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323680210] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677364997] [2024-06-27 17:10:49,416 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:10:49,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:49,417 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-06-27 17:10:49,442 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-06-27 17:10:49,491 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 17:10:49,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:10:49,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 17:10:49,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:49,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:10:49,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2024-06-27 17:10:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:49,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:49,850 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2024-06-27 17:10:49,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2024-06-27 17:10:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:10:49,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677364997] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:49,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:49,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 5] total 18 [2024-06-27 17:10:49,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471025375] [2024-06-27 17:10:49,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:49,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 17:10:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:49,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 17:10:49,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-06-27 17:10:49,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:49,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 187 transitions, 2559 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:49,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:49,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:49,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:50,701 INFO L124 PetriNetUnfolderBase]: 1469/2602 cut-off events. [2024-06-27 17:10:50,702 INFO L125 PetriNetUnfolderBase]: For 19816/19816 co-relation queries the response was YES. [2024-06-27 17:10:50,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17119 conditions, 2602 events. 1469/2602 cut-off events. For 19816/19816 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 14419 event pairs, 215 based on Foata normal form. 5/2607 useless extension candidates. Maximal degree in co-relation 17061. Up to 1572 conditions per place. [2024-06-27 17:10:50,732 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 213 selfloop transitions, 109 changer transitions 2/325 dead transitions. [2024-06-27 17:10:50,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 325 transitions, 4844 flow [2024-06-27 17:10:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-06-27 17:10:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-06-27 17:10:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 170 transitions. [2024-06-27 17:10:50,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-27 17:10:50,734 INFO L175 Difference]: Start difference. First operand has 122 places, 187 transitions, 2559 flow. Second operand 20 states and 170 transitions. [2024-06-27 17:10:50,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 325 transitions, 4844 flow [2024-06-27 17:10:50,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 325 transitions, 4504 flow, removed 148 selfloop flow, removed 8 redundant places. [2024-06-27 17:10:50,784 INFO L231 Difference]: Finished difference. Result has 141 places, 261 transitions, 3831 flow [2024-06-27 17:10:50,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3831, PETRI_PLACES=141, PETRI_TRANSITIONS=261} [2024-06-27 17:10:50,785 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 120 predicate places. [2024-06-27 17:10:50,785 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 261 transitions, 3831 flow [2024-06-27 17:10:50,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:50,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:50,785 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:50,798 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-06-27 17:10:50,988 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,SelfDestructingSolverStorable15 [2024-06-27 17:10:50,988 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:50,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -466669656, now seen corresponding path program 7 times [2024-06-27 17:10:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569083383] [2024-06-27 17:10:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:10:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569083383] [2024-06-27 17:10:52,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569083383] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:52,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793468090] [2024-06-27 17:10:52,466 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 17:10:52,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:52,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:52,468 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-06-27 17:10:52,484 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-06-27 17:10:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:52,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-27 17:10:52,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:52,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:10:52,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2024-06-27 17:10:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:10:52,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:52,852 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2024-06-27 17:10:52,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2024-06-27 17:10:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-27 17:10:52,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793468090] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:52,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:52,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 5] total 19 [2024-06-27 17:10:52,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581014174] [2024-06-27 17:10:52,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:52,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 17:10:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:52,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 17:10:52,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2024-06-27 17:10:52,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:52,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 261 transitions, 3831 flow. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:52,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:52,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:52,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:10:53,826 INFO L124 PetriNetUnfolderBase]: 1648/2922 cut-off events. [2024-06-27 17:10:53,826 INFO L125 PetriNetUnfolderBase]: For 25122/25122 co-relation queries the response was YES. [2024-06-27 17:10:53,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19927 conditions, 2922 events. 1648/2922 cut-off events. For 25122/25122 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16661 event pairs, 362 based on Foata normal form. 2/2924 useless extension candidates. Maximal degree in co-relation 18996. Up to 2343 conditions per place. [2024-06-27 17:10:53,850 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 272 selfloop transitions, 92 changer transitions 1/366 dead transitions. [2024-06-27 17:10:53,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 366 transitions, 5661 flow [2024-06-27 17:10:53,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:10:53,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:10:53,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2024-06-27 17:10:53,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527777777777778 [2024-06-27 17:10:53,852 INFO L175 Difference]: Start difference. First operand has 141 places, 261 transitions, 3831 flow. Second operand 18 states and 163 transitions. [2024-06-27 17:10:53,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 366 transitions, 5661 flow [2024-06-27 17:10:53,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 366 transitions, 5259 flow, removed 182 selfloop flow, removed 7 redundant places. [2024-06-27 17:10:53,933 INFO L231 Difference]: Finished difference. Result has 155 places, 304 transitions, 4369 flow [2024-06-27 17:10:53,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3437, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4369, PETRI_PLACES=155, PETRI_TRANSITIONS=304} [2024-06-27 17:10:53,934 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 134 predicate places. [2024-06-27 17:10:53,934 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 304 transitions, 4369 flow [2024-06-27 17:10:53,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:53,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:10:53,935 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:10:53,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-06-27 17:10:54,146 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,SelfDestructingSolverStorable16 [2024-06-27 17:10:54,146 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:10:54,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:10:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1733677407, now seen corresponding path program 8 times [2024-06-27 17:10:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:10:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438046171] [2024-06-27 17:10:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:10:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:10:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:10:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:10:54,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:10:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438046171] [2024-06-27 17:10:54,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438046171] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:10:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603095730] [2024-06-27 17:10:54,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:10:54,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:10:54,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:10:54,280 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-06-27 17:10:54,282 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-06-27 17:10:54,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:10:54,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:10:54,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 17:10:54,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:10:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:10:54,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:10:58,484 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_z_9 Int)) (or (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_9) (< v_z_9 0) (< 0 (+ (div (* 8589934593 v_z_9) 4294967296) (div (+ (* (- 8589934593) v_z_9) 3) 4294967296) 1)))) is different from false [2024-06-27 17:10:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2024-06-27 17:10:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603095730] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:10:58,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:10:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-27 17:10:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381980365] [2024-06-27 17:10:58,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:10:58,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 17:10:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:10:58,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 17:10:58,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2024-06-27 17:10:58,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:10:58,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 304 transitions, 4369 flow. Second operand has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:10:58,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:10:58,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:10:58,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:11:02,740 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (div (+ (* (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 1) 4294967296)) (<= 1 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((v_z_9 Int)) (or (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_9) (< v_z_9 0) (< 0 (+ (div (* 8589934593 v_z_9) 4294967296) (div (+ (* (- 8589934593) v_z_9) 3) 4294967296) 1))))) is different from false [2024-06-27 17:11:06,796 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (div (+ (* (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 2) 4294967296)) (forall ((v_z_9 Int)) (or (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_9) (< v_z_9 0) (< 0 (+ (div (* 8589934593 v_z_9) 4294967296) (div (+ (* (- 8589934593) v_z_9) 3) 4294967296) 1)))) (<= 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) is different from false [2024-06-27 17:11:10,990 WARN L854 $PredicateComparison]: unable to prove that (and (<= 0 (div (+ (* (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 3) 4294967296)) (forall ((v_z_9 Int)) (or (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_9) (< v_z_9 0) (< 0 (+ (div (* 8589934593 v_z_9) 4294967296) (div (+ (* (- 8589934593) v_z_9) 3) 4294967296) 1)))) (<= 3 |c_thread1Thread1of1ForFork0_~i~0#1|)) is different from false [2024-06-27 17:11:15,141 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (* 3 c_~n~0))) (< (+ (* (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) .cse0) (+ (* (div .cse0 4294967296) 4294967296) |c_thread2Thread1of1ForFork1_~i~1#1| 1))) (<= 0 (div (+ (* (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 1) 4294967296)) (<= 1 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((v_z_9 Int)) (or (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_9) (< v_z_9 0) (< 0 (+ (div (* 8589934593 v_z_9) 4294967296) (div (+ (* (- 8589934593) v_z_9) 3) 4294967296) 1))))) is different from false [2024-06-27 17:11:15,792 INFO L124 PetriNetUnfolderBase]: 1823/3387 cut-off events. [2024-06-27 17:11:15,792 INFO L125 PetriNetUnfolderBase]: For 33764/33764 co-relation queries the response was YES. [2024-06-27 17:11:15,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22346 conditions, 3387 events. 1823/3387 cut-off events. For 33764/33764 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 21750 event pairs, 303 based on Foata normal form. 24/3411 useless extension candidates. Maximal degree in co-relation 21332. Up to 1726 conditions per place. [2024-06-27 17:11:15,817 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 436 selfloop transitions, 115 changer transitions 18/570 dead transitions. [2024-06-27 17:11:15,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 570 transitions, 9019 flow [2024-06-27 17:11:15,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:11:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:11:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 125 transitions. [2024-06-27 17:11:15,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2024-06-27 17:11:15,819 INFO L175 Difference]: Start difference. First operand has 155 places, 304 transitions, 4369 flow. Second operand 14 states and 125 transitions. [2024-06-27 17:11:15,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 570 transitions, 9019 flow [2024-06-27 17:11:15,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 570 transitions, 8614 flow, removed 187 selfloop flow, removed 4 redundant places. [2024-06-27 17:11:15,902 INFO L231 Difference]: Finished difference. Result has 172 places, 398 transitions, 5780 flow [2024-06-27 17:11:15,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4120, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5780, PETRI_PLACES=172, PETRI_TRANSITIONS=398} [2024-06-27 17:11:15,903 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 151 predicate places. [2024-06-27 17:11:15,903 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 398 transitions, 5780 flow [2024-06-27 17:11:15,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0625) internal successors, (81), 16 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:11:15,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:11:15,903 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:11:15,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-06-27 17:11:16,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-06-27 17:11:16,119 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:11:16,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:11:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash -307028189, now seen corresponding path program 9 times [2024-06-27 17:11:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:11:16,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793138366] [2024-06-27 17:11:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:11:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:11:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:11:16,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:11:16,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:11:16,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793138366] [2024-06-27 17:11:16,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793138366] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:11:16,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510734740] [2024-06-27 17:11:16,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:11:16,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:11:16,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:11:16,263 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:11:16,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-06-27 17:11:16,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 17:11:16,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:11:16,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 17:11:16,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:11:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:11:16,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:11:21,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:11:21,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510734740] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:11:21,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:11:21,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-06-27 17:11:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328900393] [2024-06-27 17:11:21,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:11:21,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 17:11:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:11:21,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 17:11:21,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=245, Unknown=1, NotChecked=0, Total=306 [2024-06-27 17:11:21,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:11:21,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 398 transitions, 5780 flow. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:11:21,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:11:21,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:11:21,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:11:33,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:37,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:41,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:42,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:46,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:50,028 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 [1] [2024-06-27 17:11:53,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:54,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:11:58,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:02,273 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 [1] [2024-06-27 17:12:23,576 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 [1] [2024-06-27 17:12:24,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:38,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:41,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:45,974 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 [1] [2024-06-27 17:12:47,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:49,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:53,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:12:55,878 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 [1] [2024-06-27 17:12:59,883 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 [1] [2024-06-27 17:13:01,043 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 [1] [2024-06-27 17:13:07,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:10,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:12,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:14,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:19,417 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 [1] [2024-06-27 17:13:23,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:24,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:25,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:28,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:31,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:41,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:42,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:13:47,468 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 [1] [2024-06-27 17:14:13,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:14:17,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:14:22,786 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 [1] [2024-06-27 17:14:26,793 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 [1] [2024-06-27 17:14:31,336 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 [1] [2024-06-27 17:14:36,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:14:38,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:14:42,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 3 c_~n~0))) (let ((.cse1 (* (div .cse0 4294967296) 4294967296)) (.cse2 (* 4294967296 (div (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)))) (and (< (+ (* (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) .cse0) (+ .cse1 |c_thread2Thread1of1ForFork1_~i~1#1| 1)) (< (+ .cse2 .cse0) (+ .cse1 |c_thread2Thread1of1ForFork1_~i~1#1| 4)) (<= 0 (div (+ (* (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 3) 4294967296)) (forall ((v_z_13 Int)) (or (let ((.cse3 (* 8589934593 v_z_13))) (< (+ .cse3 .cse2) (+ (* (div .cse3 4294967296) 4294967296) |c_thread2Thread1of1ForFork1_~i~1#1| 4))) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_13) (< v_z_13 0))) (<= 3 |c_thread1Thread1of1ForFork0_~i~0#1|)))) is different from false [2024-06-27 17:14:46,693 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 [1] [2024-06-27 17:14:49,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:14:53,614 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 [1] [2024-06-27 17:14:54,995 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 [1] [2024-06-27 17:14:56,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:14:59,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:00,525 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 [1] [2024-06-27 17:15:04,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:06,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:08,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:10,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:14,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:17,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:21,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:23,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:27,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:29,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:33,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:15:37,750 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 [1] [2024-06-27 17:15:40,153 INFO L124 PetriNetUnfolderBase]: 1852/3495 cut-off events. [2024-06-27 17:15:40,153 INFO L125 PetriNetUnfolderBase]: For 39620/39620 co-relation queries the response was YES. [2024-06-27 17:15:40,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26117 conditions, 3495 events. 1852/3495 cut-off events. For 39620/39620 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 23027 event pairs, 200 based on Foata normal form. 9/3504 useless extension candidates. Maximal degree in co-relation 26039. Up to 1140 conditions per place. [2024-06-27 17:15:40,182 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 362 selfloop transitions, 302 changer transitions 32/697 dead transitions. [2024-06-27 17:15:40,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 697 transitions, 11148 flow [2024-06-27 17:15:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-06-27 17:15:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-06-27 17:15:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 206 transitions. [2024-06-27 17:15:40,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3814814814814815 [2024-06-27 17:15:40,184 INFO L175 Difference]: Start difference. First operand has 172 places, 398 transitions, 5780 flow. Second operand 27 states and 206 transitions. [2024-06-27 17:15:40,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 697 transitions, 11148 flow [2024-06-27 17:15:40,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 697 transitions, 10718 flow, removed 215 selfloop flow, removed 2 redundant places. [2024-06-27 17:15:40,338 INFO L231 Difference]: Finished difference. Result has 203 places, 513 transitions, 7852 flow [2024-06-27 17:15:40,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5516, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=7852, PETRI_PLACES=203, PETRI_TRANSITIONS=513} [2024-06-27 17:15:40,339 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 182 predicate places. [2024-06-27 17:15:40,339 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 513 transitions, 7852 flow [2024-06-27 17:15:40,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 18 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:15:40,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:15:40,340 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:15:40,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-06-27 17:15:40,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:15:40,552 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:15:40,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:15:40,553 INFO L85 PathProgramCache]: Analyzing trace with hash -223713845, now seen corresponding path program 10 times [2024-06-27 17:15:40,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:15:40,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130293464] [2024-06-27 17:15:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:15:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:15:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:15:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:15:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:15:40,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130293464] [2024-06-27 17:15:40,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130293464] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:15:40,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253934857] [2024-06-27 17:15:40,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:15:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:15:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:15:40,702 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:15:40,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-06-27 17:15:40,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:15:40,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:15:40,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 17:15:40,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:15:40,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:15:40,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:15:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:15:41,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253934857] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:15:41,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:15:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-06-27 17:15:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932346636] [2024-06-27 17:15:41,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:15:41,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-27 17:15:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:15:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-27 17:15:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2024-06-27 17:15:41,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:15:41,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 513 transitions, 7852 flow. Second operand has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:15:41,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:15:41,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:15:41,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:15:42,312 INFO L124 PetriNetUnfolderBase]: 1890/3526 cut-off events. [2024-06-27 17:15:42,313 INFO L125 PetriNetUnfolderBase]: For 46514/46514 co-relation queries the response was YES. [2024-06-27 17:15:42,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27995 conditions, 3526 events. 1890/3526 cut-off events. For 46514/46514 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22763 event pairs, 507 based on Foata normal form. 10/3536 useless extension candidates. Maximal degree in co-relation 27909. Up to 1632 conditions per place. [2024-06-27 17:15:42,339 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 308 selfloop transitions, 327 changer transitions 1/637 dead transitions. [2024-06-27 17:15:42,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 637 transitions, 10918 flow [2024-06-27 17:15:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-06-27 17:15:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-06-27 17:15:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 207 transitions. [2024-06-27 17:15:42,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.414 [2024-06-27 17:15:42,343 INFO L175 Difference]: Start difference. First operand has 203 places, 513 transitions, 7852 flow. Second operand 25 states and 207 transitions. [2024-06-27 17:15:42,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 637 transitions, 10918 flow [2024-06-27 17:15:42,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 637 transitions, 10273 flow, removed 156 selfloop flow, removed 6 redundant places. [2024-06-27 17:15:42,511 INFO L231 Difference]: Finished difference. Result has 227 places, 546 transitions, 8634 flow [2024-06-27 17:15:42,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7269, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=295, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=8634, PETRI_PLACES=227, PETRI_TRANSITIONS=546} [2024-06-27 17:15:42,511 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2024-06-27 17:15:42,512 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 546 transitions, 8634 flow [2024-06-27 17:15:42,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:15:42,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:15:42,512 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:15:42,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-06-27 17:15:42,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2024-06-27 17:15:42,713 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:15:42,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:15:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1775229125, now seen corresponding path program 11 times [2024-06-27 17:15:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:15:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935933445] [2024-06-27 17:15:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:15:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:15:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:15:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:15:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:15:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935933445] [2024-06-27 17:15:42,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935933445] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:15:42,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112185021] [2024-06-27 17:15:42,862 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:15:42,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:15:42,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:15:42,863 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:15:42,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-06-27 17:15:43,168 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-27 17:15:43,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:15:43,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 17:15:43,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:15:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:15:43,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:15:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:15:44,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112185021] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:15:44,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:15:44,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-06-27 17:15:44,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779528547] [2024-06-27 17:15:44,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:15:44,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-27 17:15:44,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:15:44,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-27 17:15:44,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-06-27 17:15:44,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:15:44,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 546 transitions, 8634 flow. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:15:44,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:15:44,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:15:44,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:16:11,225 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_19 Int)) (or (< v_z_19 0) (let ((.cse0 (* 8589934593 v_z_19))) (< (+ (* 4294967296 (div (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) .cse0) (+ |c_thread2Thread1of1ForFork1_~i~1#1| (* (div .cse0 4294967296) 4294967296) 4))) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_19))) (<= 0 (div (+ (* (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 2) 4294967296)) (<= 0 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (* (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1|) |c_thread2Thread1of1ForFork1_~i~1#1|) (<= 2 |c_thread1Thread1of1ForFork0_~i~0#1|)) is different from false [2024-06-27 17:16:15,236 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 [1] [2024-06-27 17:16:19,244 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 [1] [2024-06-27 17:16:23,252 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 [1] [2024-06-27 17:16:26,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:28,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:32,149 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 [1] [2024-06-27 17:16:36,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:40,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:44,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:48,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:51,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:53,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:16:57,845 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 [1] [2024-06-27 17:17:01,854 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 [1] [2024-06-27 17:17:05,863 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 [1] [2024-06-27 17:17:30,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:17:34,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:17:38,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:17:41,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:17:45,864 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 [1] [2024-06-27 17:17:49,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:17:53,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:17:57,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:01,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:06,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:10,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:14,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:18,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:22,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:23,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:25,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:29,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:30,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:34,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:38,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:43,512 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 [1] [2024-06-27 17:18:52,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:18:56,567 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 [1] [2024-06-27 17:18:59,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:03,039 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 [1] [2024-06-27 17:19:07,047 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 [1] [2024-06-27 17:19:11,842 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 [1] [2024-06-27 17:19:15,852 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 [1] [2024-06-27 17:19:17,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:21,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:25,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:28,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:33,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:37,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:38,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:39,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:42,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:19:46,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:00,338 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 [1] [2024-06-27 17:20:09,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:14,586 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 [1] [2024-06-27 17:20:18,592 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 [1] [2024-06-27 17:20:25,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:30,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:32,540 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 [1] [2024-06-27 17:20:33,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:34,729 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 [1] [2024-06-27 17:20:36,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:40,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:41,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:20:44,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:06,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:10,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:15,676 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 [1] [2024-06-27 17:21:17,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:21,691 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 [1] [2024-06-27 17:21:23,159 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 [1] [2024-06-27 17:21:27,167 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 [1] [2024-06-27 17:21:30,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:34,187 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 [1] [2024-06-27 17:21:38,715 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 [1] [2024-06-27 17:21:42,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:43,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:44,224 INFO L124 PetriNetUnfolderBase]: 2050/4144 cut-off events. [2024-06-27 17:21:44,225 INFO L125 PetriNetUnfolderBase]: For 66971/66971 co-relation queries the response was YES. [2024-06-27 17:21:44,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33895 conditions, 4144 events. 2050/4144 cut-off events. For 66971/66971 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 30180 event pairs, 202 based on Foata normal form. 12/4156 useless extension candidates. Maximal degree in co-relation 33799. Up to 1172 conditions per place. [2024-06-27 17:21:44,256 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 405 selfloop transitions, 446 changer transitions 6/858 dead transitions. [2024-06-27 17:21:44,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 858 transitions, 14898 flow [2024-06-27 17:21:44,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-06-27 17:21:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-06-27 17:21:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 249 transitions. [2024-06-27 17:21:44,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37727272727272726 [2024-06-27 17:21:44,257 INFO L175 Difference]: Start difference. First operand has 227 places, 546 transitions, 8634 flow. Second operand 33 states and 249 transitions. [2024-06-27 17:21:44,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 858 transitions, 14898 flow [2024-06-27 17:21:44,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 858 transitions, 14168 flow, removed 211 selfloop flow, removed 10 redundant places. [2024-06-27 17:21:44,492 INFO L231 Difference]: Finished difference. Result has 253 places, 670 transitions, 11202 flow [2024-06-27 17:21:44,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7959, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=11202, PETRI_PLACES=253, PETRI_TRANSITIONS=670} [2024-06-27 17:21:44,492 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 232 predicate places. [2024-06-27 17:21:44,492 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 670 transitions, 11202 flow [2024-06-27 17:21:44,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:44,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:44,493 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:21:44,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-06-27 17:21:44,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:21:44,695 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:21:44,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash -614207011, now seen corresponding path program 12 times [2024-06-27 17:21:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669295753] [2024-06-27 17:21:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:21:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669295753] [2024-06-27 17:21:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669295753] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:21:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4736286] [2024-06-27 17:21:44,843 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:21:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:21:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:21:44,844 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:21:44,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-06-27 17:21:44,931 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-27 17:21:44,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:21:44,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 17:21:44,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:21:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:21:45,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:21:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:21:49,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4736286] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:21:49,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:21:49,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-06-27 17:21:49,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703224608] [2024-06-27 17:21:49,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:21:49,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-27 17:21:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:49,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-27 17:21:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-06-27 17:21:49,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:21:49,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 670 transitions, 11202 flow. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:49,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:49,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:21:49,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:53,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:21:57,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:01,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:05,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:09,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:13,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:16,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:18,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:21,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:25,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:29,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:30,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:34,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:38,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:42,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:46,897 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 [1] [2024-06-27 17:22:50,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:53,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:55,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:57,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:59,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:01,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:04,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:09,079 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 [1] [2024-06-27 17:23:10,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:14,170 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 [1] [2024-06-27 17:23:18,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:19,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:23,249 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 [1] [2024-06-27 17:23:24,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:25,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:29,892 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 [1] [2024-06-27 17:23:34,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:38,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:42,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:46,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:50,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:52,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:56,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:59,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15