./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.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/bench-exp2x4.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 f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:26:53,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:26:53,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:26:53,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:26:53,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:26:53,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:26:53,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:26:53,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:26:53,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:26:53,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:26:53,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:26:53,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:26:53,999 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:26:54,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:26:54,004 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:26:54,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:26:54,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:26:54,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:26:54,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:26:54,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:26:54,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:26:54,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:26:54,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:26:54,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:26:54,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:26:54,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:26:54,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:26:54,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:26:54,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:26:54,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:26:54,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:26:54,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:26:54,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:26:54,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:26:54,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:26:54,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:26:54,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:26:54,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:26:54,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:26:54,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:26:54,010 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:26:54,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:26:54,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:26:54,011 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 -> f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 [2024-06-27 16:26:54,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:26:54,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:26:54,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:26:54,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:26:54,213 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:26:54,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-06-27 16:26:55,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:26:55,395 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:26:55,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-06-27 16:26:55,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2cda32b2/c3747131207d41bb86e64c2d35cc1252/FLAG7ab07ce36 [2024-06-27 16:26:55,420 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2cda32b2/c3747131207d41bb86e64c2d35cc1252 [2024-06-27 16:26:55,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:26:55,422 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:26:55,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:26:55,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:26:55,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:26:55,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1742596c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55, skipping insertion in model container [2024-06-27 16:26:55,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,445 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:26:55,647 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/bench-exp2x4.wvr.c[2361,2374] [2024-06-27 16:26:55,665 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:26:55,672 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:26:55,686 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/bench-exp2x4.wvr.c[2361,2374] [2024-06-27 16:26:55,687 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:26:55,700 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:26:55,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55 WrapperNode [2024-06-27 16:26:55,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:26:55,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:26:55,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:26:55,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:26:55,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,726 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-06-27 16:26:55,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:26:55,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:26:55,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:26:55,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:26:55,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,746 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 16:26:55,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:26:55,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:26:55,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:26:55,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:26:55,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (1/1) ... [2024-06-27 16:26:55,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:26:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:26:55,798 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 16:26:55,813 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 16:26:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:26:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:26:55,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:26:55,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:26:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:26:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:26:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:26:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 16:26:55,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 16:26:55,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:26:55,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:26:55,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:26:55,834 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 16:26:55,896 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:26:55,898 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:26:56,119 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:26:56,121 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:26:56,263 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:26:56,263 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 16:26:56,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:26:56 BoogieIcfgContainer [2024-06-27 16:26:56,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:26:56,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:26:56,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:26:56,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:26:56,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:26:55" (1/3) ... [2024-06-27 16:26:56,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d4a73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:26:56, skipping insertion in model container [2024-06-27 16:26:56,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:26:55" (2/3) ... [2024-06-27 16:26:56,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d4a73c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:26:56, skipping insertion in model container [2024-06-27 16:26:56,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:26:56" (3/3) ... [2024-06-27 16:26:56,269 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-06-27 16:26:56,275 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:26:56,281 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:26:56,282 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:26:56,282 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:26:56,334 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-06-27 16:26:56,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 92 flow [2024-06-27 16:26:56,376 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-06-27 16:26:56,377 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:26:56,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 28 events. 4/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-06-27 16:26:56,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 32 transitions, 92 flow [2024-06-27 16:26:56,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2024-06-27 16:26:56,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:26:56,393 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;@5bd31eab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:26:56,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 16:26:56,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:26:56,401 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-06-27 16:26:56,401 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 16:26:56,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:56,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:56,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:56,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -739026557, now seen corresponding path program 1 times [2024-06-27 16:26:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851983987] [2024-06-27 16:26:56,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:56,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:56,835 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 16:26:56,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:56,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851983987] [2024-06-27 16:26:56,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851983987] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:56,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:26:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329359328] [2024-06-27 16:26:56,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:56,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:26:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:56,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:26:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:26:56,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:56,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 16:26:56,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:56,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:56,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:57,117 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2024-06-27 16:26:57,118 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2024-06-27 16:26:57,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5586 event pairs, 123 based on Foata normal form. 1/989 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2024-06-27 16:26:57,129 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2024-06-27 16:26:57,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2024-06-27 16:26:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:26:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:26:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-06-27 16:26:57,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-06-27 16:26:57,139 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 69 transitions. [2024-06-27 16:26:57,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2024-06-27 16:26:57,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-27 16:26:57,144 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2024-06-27 16:26:57,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2024-06-27 16:26:57,147 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2024-06-27 16:26:57,147 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2024-06-27 16:26:57,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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 16:26:57,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:57,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:57,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:26:57,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:57,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:57,149 INFO L85 PathProgramCache]: Analyzing trace with hash 738834492, now seen corresponding path program 1 times [2024-06-27 16:26:57,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:57,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355623565] [2024-06-27 16:26:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:57,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:57,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:57,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355623565] [2024-06-27 16:26:57,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355623565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:57,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:57,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:57,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596682531] [2024-06-27 16:26:57,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:57,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:57,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:57,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:57,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:57,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:57,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:57,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:57,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:57,413 INFO L124 PetriNetUnfolderBase]: 1593/2038 cut-off events. [2024-06-27 16:26:57,413 INFO L125 PetriNetUnfolderBase]: For 483/483 co-relation queries the response was YES. [2024-06-27 16:26:57,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 2038 events. 1593/2038 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7034 event pairs, 113 based on Foata normal form. 34/2060 useless extension candidates. Maximal degree in co-relation 1272. Up to 842 conditions per place. [2024-06-27 16:26:57,423 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 66 selfloop transitions, 10 changer transitions 0/81 dead transitions. [2024-06-27 16:26:57,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 391 flow [2024-06-27 16:26:57,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-27 16:26:57,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-06-27 16:26:57,425 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 115 transitions. [2024-06-27 16:26:57,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 391 flow [2024-06-27 16:26:57,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 81 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:26:57,427 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2024-06-27 16:26:57,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2024-06-27 16:26:57,427 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2024-06-27 16:26:57,428 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2024-06-27 16:26:57,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:57,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:57,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:57,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:26:57,428 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:57,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash 443074054, now seen corresponding path program 1 times [2024-06-27 16:26:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827702311] [2024-06-27 16:26:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827702311] [2024-06-27 16:26:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827702311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:57,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861108741] [2024-06-27 16:26:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:57,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:57,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:57,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:57,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:57,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:57,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:57,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:57,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:57,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:57,762 INFO L124 PetriNetUnfolderBase]: 1921/2549 cut-off events. [2024-06-27 16:26:57,762 INFO L125 PetriNetUnfolderBase]: For 3334/3334 co-relation queries the response was YES. [2024-06-27 16:26:57,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 2549 events. 1921/2549 cut-off events. For 3334/3334 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10112 event pairs, 288 based on Foata normal form. 64/2541 useless extension candidates. Maximal degree in co-relation 3126. Up to 1063 conditions per place. [2024-06-27 16:26:57,777 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 79 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2024-06-27 16:26:57,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 92 transitions, 571 flow [2024-06-27 16:26:57,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:57,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-06-27 16:26:57,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.675 [2024-06-27 16:26:57,782 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 108 transitions. [2024-06-27 16:26:57,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 92 transitions, 571 flow [2024-06-27 16:26:57,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 92 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:26:57,788 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2024-06-27 16:26:57,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2024-06-27 16:26:57,789 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2024-06-27 16:26:57,789 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2024-06-27 16:26:57,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:57,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:57,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:57,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:26:57,789 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:57,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash -936143522, now seen corresponding path program 2 times [2024-06-27 16:26:57,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:57,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966299495] [2024-06-27 16:26:57,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:57,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:57,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:57,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966299495] [2024-06-27 16:26:57,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966299495] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:57,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:57,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:57,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321820498] [2024-06-27 16:26:57,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:57,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:57,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:57,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:57,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:57,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:57,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:57,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:58,112 INFO L124 PetriNetUnfolderBase]: 1835/2445 cut-off events. [2024-06-27 16:26:58,112 INFO L125 PetriNetUnfolderBase]: For 4078/4078 co-relation queries the response was YES. [2024-06-27 16:26:58,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9087 conditions, 2445 events. 1835/2445 cut-off events. For 4078/4078 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 9926 event pairs, 348 based on Foata normal form. 90/2505 useless extension candidates. Maximal degree in co-relation 4692. Up to 1412 conditions per place. [2024-06-27 16:26:58,125 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 83 selfloop transitions, 10 changer transitions 0/98 dead transitions. [2024-06-27 16:26:58,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 649 flow [2024-06-27 16:26:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-27 16:26:58,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7125 [2024-06-27 16:26:58,127 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 114 transitions. [2024-06-27 16:26:58,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 98 transitions, 649 flow [2024-06-27 16:26:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 98 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 16:26:58,133 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 264 flow [2024-06-27 16:26:58,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-06-27 16:26:58,134 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2024-06-27 16:26:58,134 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 264 flow [2024-06-27 16:26:58,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:58,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:58,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:58,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:26:58,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:58,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:58,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1180704031, now seen corresponding path program 1 times [2024-06-27 16:26:58,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345201474] [2024-06-27 16:26:58,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:58,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:58,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345201474] [2024-06-27 16:26:58,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345201474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:58,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613476339] [2024-06-27 16:26:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:58,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:58,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:58,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:58,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:58,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:58,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:58,411 INFO L124 PetriNetUnfolderBase]: 1783/2380 cut-off events. [2024-06-27 16:26:58,411 INFO L125 PetriNetUnfolderBase]: For 6417/6417 co-relation queries the response was YES. [2024-06-27 16:26:58,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9796 conditions, 2380 events. 1783/2380 cut-off events. For 6417/6417 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9700 event pairs, 131 based on Foata normal form. 52/2423 useless extension candidates. Maximal degree in co-relation 5285. Up to 1057 conditions per place. [2024-06-27 16:26:58,424 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 84 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2024-06-27 16:26:58,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 673 flow [2024-06-27 16:26:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:58,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-06-27 16:26:58,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-06-27 16:26:58,425 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 264 flow. Second operand 5 states and 113 transitions. [2024-06-27 16:26:58,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 673 flow [2024-06-27 16:26:58,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 97 transitions, 664 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:26:58,433 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 269 flow [2024-06-27 16:26:58,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-06-27 16:26:58,433 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2024-06-27 16:26:58,433 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 269 flow [2024-06-27 16:26:58,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:58,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:58,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:58,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:26:58,434 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:58,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1435152238, now seen corresponding path program 2 times [2024-06-27 16:26:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355421944] [2024-06-27 16:26:58,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355421944] [2024-06-27 16:26:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355421944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187359308] [2024-06-27 16:26:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:58,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:58,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:58,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 269 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:58,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:58,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:58,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:58,658 INFO L124 PetriNetUnfolderBase]: 1610/2155 cut-off events. [2024-06-27 16:26:58,658 INFO L125 PetriNetUnfolderBase]: For 6944/6944 co-relation queries the response was YES. [2024-06-27 16:26:58,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9113 conditions, 2155 events. 1610/2155 cut-off events. For 6944/6944 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8179 event pairs, 91 based on Foata normal form. 31/2140 useless extension candidates. Maximal degree in co-relation 5267. Up to 897 conditions per place. [2024-06-27 16:26:58,671 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 92 selfloop transitions, 11 changer transitions 0/108 dead transitions. [2024-06-27 16:26:58,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 108 transitions, 889 flow [2024-06-27 16:26:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 16:26:58,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66875 [2024-06-27 16:26:58,672 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 269 flow. Second operand 5 states and 107 transitions. [2024-06-27 16:26:58,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 108 transitions, 889 flow [2024-06-27 16:26:58,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 864 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 16:26:58,697 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 321 flow [2024-06-27 16:26:58,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-27 16:26:58,697 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2024-06-27 16:26:58,697 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 321 flow [2024-06-27 16:26:58,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:58,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:58,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:58,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:26:58,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:58,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1624832805, now seen corresponding path program 1 times [2024-06-27 16:26:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:58,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183660791] [2024-06-27 16:26:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183660791] [2024-06-27 16:26:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183660791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:58,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667771588] [2024-06-27 16:26:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:58,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:58,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:58,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:58,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:58,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 321 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:58,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:58,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:58,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:58,945 INFO L124 PetriNetUnfolderBase]: 1577/2122 cut-off events. [2024-06-27 16:26:58,946 INFO L125 PetriNetUnfolderBase]: For 7108/7108 co-relation queries the response was YES. [2024-06-27 16:26:58,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9586 conditions, 2122 events. 1577/2122 cut-off events. For 7108/7108 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 8146 event pairs, 71 based on Foata normal form. 33/2109 useless extension candidates. Maximal degree in co-relation 6031. Up to 983 conditions per place. [2024-06-27 16:26:58,959 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 88 selfloop transitions, 8 changer transitions 4/105 dead transitions. [2024-06-27 16:26:58,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 873 flow [2024-06-27 16:26:58,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-06-27 16:26:58,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-06-27 16:26:58,961 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 321 flow. Second operand 5 states and 105 transitions. [2024-06-27 16:26:58,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 873 flow [2024-06-27 16:26:58,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 862 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:26:58,969 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 324 flow [2024-06-27 16:26:58,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2024-06-27 16:26:58,969 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 25 predicate places. [2024-06-27 16:26:58,969 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 324 flow [2024-06-27 16:26:58,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:58,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:58,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:58,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 16:26:58,970 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:58,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1713705335, now seen corresponding path program 2 times [2024-06-27 16:26:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:58,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853957545] [2024-06-27 16:26:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:59,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:59,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853957545] [2024-06-27 16:26:59,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853957545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:59,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:59,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:59,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328867601] [2024-06-27 16:26:59,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:59,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:59,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:59,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:59,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:59,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:59,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:59,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:59,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:59,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:59,226 INFO L124 PetriNetUnfolderBase]: 1515/2072 cut-off events. [2024-06-27 16:26:59,226 INFO L125 PetriNetUnfolderBase]: For 7421/7421 co-relation queries the response was YES. [2024-06-27 16:26:59,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 2072 events. 1515/2072 cut-off events. For 7421/7421 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8404 event pairs, 258 based on Foata normal form. 62/2076 useless extension candidates. Maximal degree in co-relation 6059. Up to 1124 conditions per place. [2024-06-27 16:26:59,239 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2024-06-27 16:26:59,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 893 flow [2024-06-27 16:26:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-06-27 16:26:59,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64375 [2024-06-27 16:26:59,240 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 324 flow. Second operand 5 states and 103 transitions. [2024-06-27 16:26:59,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 893 flow [2024-06-27 16:26:59,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 880 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:26:59,247 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 364 flow [2024-06-27 16:26:59,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-06-27 16:26:59,248 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2024-06-27 16:26:59,248 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 364 flow [2024-06-27 16:26:59,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:59,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:59,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:59,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:26:59,249 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:59,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 27765697, now seen corresponding path program 2 times [2024-06-27 16:26:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:59,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548270796] [2024-06-27 16:26:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:59,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548270796] [2024-06-27 16:26:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548270796] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:26:59,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:26:59,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:26:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359567707] [2024-06-27 16:26:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:26:59,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:26:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:26:59,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:26:59,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:26:59,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:26:59,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:59,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:26:59,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:26:59,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:26:59,510 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2024-06-27 16:26:59,510 INFO L125 PetriNetUnfolderBase]: For 7054/7054 co-relation queries the response was YES. [2024-06-27 16:26:59,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 1987 events. 1447/1987 cut-off events. For 7054/7054 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8130 event pairs, 375 based on Foata normal form. 68/2029 useless extension candidates. Maximal degree in co-relation 8664. Up to 1150 conditions per place. [2024-06-27 16:26:59,521 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2024-06-27 16:26:59,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1094 flow [2024-06-27 16:26:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:26:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:26:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-27 16:26:59,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-06-27 16:26:59,522 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 364 flow. Second operand 5 states and 111 transitions. [2024-06-27 16:26:59,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1094 flow [2024-06-27 16:26:59,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 1036 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-06-27 16:26:59,532 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 401 flow [2024-06-27 16:26:59,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=401, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-06-27 16:26:59,533 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 34 predicate places. [2024-06-27 16:26:59,533 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 401 flow [2024-06-27 16:26:59,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 16:26:59,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:26:59,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:26:59,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:26:59,533 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:26:59,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:26:59,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1581203672, now seen corresponding path program 1 times [2024-06-27 16:26:59,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:26:59,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595466077] [2024-06-27 16:26:59,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:59,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:26:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:26:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:26:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:26:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595466077] [2024-06-27 16:26:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595466077] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:26:59,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106299944] [2024-06-27 16:26:59,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:26:59,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:26:59,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:26:59,829 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 16:26:59,862 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 16:27:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:00,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:27:00,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:28:31,878 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:29:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:29:16,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:29:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:29:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106299944] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:29:51,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:29:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-06-27 16:29:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574162343] [2024-06-27 16:29:51,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:29:51,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:29:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:29:51,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:29:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=162, Unknown=17, NotChecked=0, Total=240 [2024-06-27 16:29:51,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:29:51,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 401 flow. Second operand has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:29:51,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:29:51,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:29:51,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:30:04,122 WARN L293 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 68 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:30:23,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:30:27,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:30:51,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:30:55,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:30:58,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:30:59,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:31:14,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:31:20,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:31:28,617 INFO L124 PetriNetUnfolderBase]: 2897/3964 cut-off events. [2024-06-27 16:31:28,617 INFO L125 PetriNetUnfolderBase]: For 14898/14898 co-relation queries the response was YES. [2024-06-27 16:31:28,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19921 conditions, 3964 events. 2897/3964 cut-off events. For 14898/14898 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 17401 event pairs, 82 based on Foata normal form. 14/3960 useless extension candidates. Maximal degree in co-relation 17607. Up to 1865 conditions per place. [2024-06-27 16:31:28,646 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 194 selfloop transitions, 106 changer transitions 24/329 dead transitions. [2024-06-27 16:31:28,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 329 transitions, 2903 flow [2024-06-27 16:31:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 16:31:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 16:31:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 376 transitions. [2024-06-27 16:31:28,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2024-06-27 16:31:28,648 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 401 flow. Second operand 17 states and 376 transitions. [2024-06-27 16:31:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 329 transitions, 2903 flow [2024-06-27 16:31:28,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 329 transitions, 2830 flow, removed 20 selfloop flow, removed 1 redundant places. [2024-06-27 16:31:28,669 INFO L231 Difference]: Finished difference. Result has 94 places, 160 transitions, 1773 flow [2024-06-27 16:31:28,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1773, PETRI_PLACES=94, PETRI_TRANSITIONS=160} [2024-06-27 16:31:28,670 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 58 predicate places. [2024-06-27 16:31:28,670 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 160 transitions, 1773 flow [2024-06-27 16:31:28,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5) internal successors, (200), 16 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:31:28,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:31:28,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:31:28,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 16:31:28,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 16:31:28,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:31:28,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:31:28,882 INFO L85 PathProgramCache]: Analyzing trace with hash 380082304, now seen corresponding path program 2 times [2024-06-27 16:31:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:31:28,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386404370] [2024-06-27 16:31:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:31:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:31:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:31:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:31:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:31:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386404370] [2024-06-27 16:31:29,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386404370] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:31:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79477358] [2024-06-27 16:31:29,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:31:29,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:31:29,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:31:29,290 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 16:31:29,293 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 16:31:29,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:31:29,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:31:29,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:31:29,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:32:05,171 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:32:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:32:35,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:32:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:32:36,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79477358] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:32:36,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:32:36,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-06-27 16:32:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109073854] [2024-06-27 16:32:36,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:32:36,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:32:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:32:36,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:32:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=159, Unknown=1, NotChecked=0, Total=240 [2024-06-27 16:32:36,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:32:36,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 160 transitions, 1773 flow. Second operand has 16 states, 16 states have (on average 12.5625) internal successors, (201), 16 states have internal predecessors, (201), 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 16:32:36,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:32:36,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:32:36,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:32:42,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:32:47,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:32:49,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:32:53,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:32:57,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:02,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:07,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:11,199 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 [] [2024-06-27 16:33:13,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:18,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:19,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:21,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:24,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:24,223 INFO L124 PetriNetUnfolderBase]: 4372/6018 cut-off events. [2024-06-27 16:33:24,223 INFO L125 PetriNetUnfolderBase]: For 31641/31641 co-relation queries the response was YES. [2024-06-27 16:33:24,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35229 conditions, 6018 events. 4372/6018 cut-off events. For 31641/31641 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 29054 event pairs, 310 based on Foata normal form. 15/6011 useless extension candidates. Maximal degree in co-relation 34155. Up to 4128 conditions per place. [2024-06-27 16:33:24,263 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 277 selfloop transitions, 164 changer transitions 15/461 dead transitions. [2024-06-27 16:33:24,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 461 transitions, 5372 flow [2024-06-27 16:33:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 16:33:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 16:33:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 357 transitions. [2024-06-27 16:33:24,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-06-27 16:33:24,266 INFO L175 Difference]: Start difference. First operand has 94 places, 160 transitions, 1773 flow. Second operand 17 states and 357 transitions. [2024-06-27 16:33:24,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 461 transitions, 5372 flow [2024-06-27 16:33:24,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 461 transitions, 5099 flow, removed 133 selfloop flow, removed 1 redundant places. [2024-06-27 16:33:24,431 INFO L231 Difference]: Finished difference. Result has 118 places, 311 transitions, 3930 flow [2024-06-27 16:33:24,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1554, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3930, PETRI_PLACES=118, PETRI_TRANSITIONS=311} [2024-06-27 16:33:24,432 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 82 predicate places. [2024-06-27 16:33:24,432 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 311 transitions, 3930 flow [2024-06-27 16:33:24,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.5625) internal successors, (201), 16 states have internal predecessors, (201), 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 16:33:24,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:33:24,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:33:24,446 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 16:33:24,639 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,SelfDestructingSolverStorable10 [2024-06-27 16:33:24,639 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:33:24,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:33:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 743443040, now seen corresponding path program 1 times [2024-06-27 16:33:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:33:24,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574193882] [2024-06-27 16:33:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:33:24,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:33:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:33:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:33:24,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:33:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574193882] [2024-06-27 16:33:24,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574193882] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:33:24,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153115804] [2024-06-27 16:33:24,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:33:24,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:33:24,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:33:24,932 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 16:33:24,933 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 16:33:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:33:25,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 16:33:25,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:34:11,138 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:34:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:34:35,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:34:35,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:34:35,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153115804] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:34:35,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:34:35,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 16 [2024-06-27 16:34:35,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096759939] [2024-06-27 16:34:35,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:34:35,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 16:34:35,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:34:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 16:34:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=189, Unknown=4, NotChecked=0, Total=272 [2024-06-27 16:34:35,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:34:35,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 311 transitions, 3930 flow. Second operand has 17 states, 17 states have (on average 12.117647058823529) internal successors, (206), 17 states have internal predecessors, (206), 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 16:34:35,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:34:35,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:34:35,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:34:48,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:34:49,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:34:53,250 INFO L124 PetriNetUnfolderBase]: 6121/8529 cut-off events. [2024-06-27 16:34:53,250 INFO L125 PetriNetUnfolderBase]: For 54586/54586 co-relation queries the response was YES. [2024-06-27 16:34:53,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52745 conditions, 8529 events. 6121/8529 cut-off events. For 54586/54586 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 44644 event pairs, 377 based on Foata normal form. 30/8537 useless extension candidates. Maximal degree in co-relation 51621. Up to 6118 conditions per place. [2024-06-27 16:34:53,310 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 468 selfloop transitions, 128 changer transitions 16/617 dead transitions. [2024-06-27 16:34:53,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 617 transitions, 7720 flow [2024-06-27 16:34:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 16:34:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 16:34:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 376 transitions. [2024-06-27 16:34:53,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.734375 [2024-06-27 16:34:53,313 INFO L175 Difference]: Start difference. First operand has 118 places, 311 transitions, 3930 flow. Second operand 16 states and 376 transitions. [2024-06-27 16:34:53,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 617 transitions, 7720 flow [2024-06-27 16:34:53,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 617 transitions, 7379 flow, removed 163 selfloop flow, removed 2 redundant places. [2024-06-27 16:34:53,693 INFO L231 Difference]: Finished difference. Result has 142 places, 436 transitions, 5616 flow [2024-06-27 16:34:53,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3589, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5616, PETRI_PLACES=142, PETRI_TRANSITIONS=436} [2024-06-27 16:34:53,695 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 106 predicate places. [2024-06-27 16:34:53,695 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 436 transitions, 5616 flow [2024-06-27 16:34:53,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.117647058823529) internal successors, (206), 17 states have internal predecessors, (206), 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 16:34:53,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:34:53,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:34:53,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 16:34:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:34:53,907 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:34:53,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:34:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1390917102, now seen corresponding path program 2 times [2024-06-27 16:34:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:34:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139871197] [2024-06-27 16:34:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:34:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:34:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:34:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:34:54,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:34:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139871197] [2024-06-27 16:34:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139871197] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:34:54,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687890140] [2024-06-27 16:34:54,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:34:54,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:34:54,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:34:54,221 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 16:34:54,222 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 16:34:54,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:34:54,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:34:54,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 16:34:54,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:36:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:36:08,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:36:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:36:20,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687890140] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:36:20,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:36:20,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-06-27 16:36:20,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187862125] [2024-06-27 16:36:20,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:36:20,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 16:36:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:36:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 16:36:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=136, Unknown=5, NotChecked=0, Total=182 [2024-06-27 16:36:20,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:36:20,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 436 transitions, 5616 flow. Second operand has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 14 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:36:20,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:36:20,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:36:20,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:36:23,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:36:35,100 WARN L293 SmtUtils]: Spent 11.12s on a formula simplification. DAG size of input: 66 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:36:36,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:36:38,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:36:52,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:36:54,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:36:57,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:37:03,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:37:06,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:37:13,479 INFO L124 PetriNetUnfolderBase]: 6854/9592 cut-off events. [2024-06-27 16:37:13,480 INFO L125 PetriNetUnfolderBase]: For 81071/81071 co-relation queries the response was YES. [2024-06-27 16:37:13,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63432 conditions, 9592 events. 6854/9592 cut-off events. For 81071/81071 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 51400 event pairs, 767 based on Foata normal form. 4/9574 useless extension candidates. Maximal degree in co-relation 62359. Up to 8333 conditions per place. [2024-06-27 16:37:13,584 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 499 selfloop transitions, 50 changer transitions 6/560 dead transitions. [2024-06-27 16:37:13,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 560 transitions, 7713 flow [2024-06-27 16:37:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 16:37:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 16:37:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions. [2024-06-27 16:37:13,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-06-27 16:37:13,586 INFO L175 Difference]: Start difference. First operand has 142 places, 436 transitions, 5616 flow. Second operand 9 states and 216 transitions. [2024-06-27 16:37:13,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 560 transitions, 7713 flow [2024-06-27 16:37:13,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 560 transitions, 7108 flow, removed 299 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:13,896 INFO L231 Difference]: Finished difference. Result has 153 places, 463 transitions, 5621 flow [2024-06-27 16:37:13,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5017, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5621, PETRI_PLACES=153, PETRI_TRANSITIONS=463} [2024-06-27 16:37:13,897 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 117 predicate places. [2024-06-27 16:37:13,897 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 463 transitions, 5621 flow [2024-06-27 16:37:13,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.785714285714286) internal successors, (179), 14 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:37:13,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:13,898 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:13,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-27 16:37:14,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:14,110 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:37:14,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -168152671, now seen corresponding path program 3 times [2024-06-27 16:37:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999403928] [2024-06-27 16:37:14,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:37:14,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:14,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999403928] [2024-06-27 16:37:14,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999403928] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:37:14,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390761711] [2024-06-27 16:37:14,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 16:37:14,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:14,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:37:14,213 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 16:37:14,214 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 16:37:14,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-27 16:37:14,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:14,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 16:37:14,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:37:15,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:37:15,702 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:37:15,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390761711] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:37:15,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:37:15,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 15 [2024-06-27 16:37:15,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616877085] [2024-06-27 16:37:15,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:37:15,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:37:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:37:15,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-06-27 16:37:15,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:37:15,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 463 transitions, 5621 flow. Second operand has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 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 16:37:15,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:15,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:37:15,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:22,646 INFO L124 PetriNetUnfolderBase]: 8864/12370 cut-off events. [2024-06-27 16:37:22,646 INFO L125 PetriNetUnfolderBase]: For 119903/119903 co-relation queries the response was YES. [2024-06-27 16:37:22,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82654 conditions, 12370 events. 8864/12370 cut-off events. For 119903/119903 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 67777 event pairs, 205 based on Foata normal form. 258/12610 useless extension candidates. Maximal degree in co-relation 81716. Up to 3796 conditions per place. [2024-06-27 16:37:22,809 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 682 selfloop transitions, 288 changer transitions 39/1014 dead transitions. [2024-06-27 16:37:22,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1014 transitions, 13878 flow [2024-06-27 16:37:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-06-27 16:37:22,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-06-27 16:37:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 441 transitions. [2024-06-27 16:37:22,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65625 [2024-06-27 16:37:22,812 INFO L175 Difference]: Start difference. First operand has 153 places, 463 transitions, 5621 flow. Second operand 21 states and 441 transitions. [2024-06-27 16:37:22,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1014 transitions, 13878 flow [2024-06-27 16:37:23,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1014 transitions, 13511 flow, removed 180 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:23,308 INFO L231 Difference]: Finished difference. Result has 182 places, 584 transitions, 8342 flow [2024-06-27 16:37:23,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5167, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8342, PETRI_PLACES=182, PETRI_TRANSITIONS=584} [2024-06-27 16:37:23,309 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 146 predicate places. [2024-06-27 16:37:23,309 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 584 transitions, 8342 flow [2024-06-27 16:37:23,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 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 16:37:23,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:23,310 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:23,321 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 16:37:23,521 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,SelfDestructingSolverStorable13 [2024-06-27 16:37:23,521 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-06-27 16:37:23,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:23,522 INFO L85 PathProgramCache]: Analyzing trace with hash -800178407, now seen corresponding path program 4 times [2024-06-27 16:37:23,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:23,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754766520] [2024-06-27 16:37:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:37:23,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754766520] [2024-06-27 16:37:23,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754766520] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:37:23,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255992750] [2024-06-27 16:37:23,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 16:37:23,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:23,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:37:23,636 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 16:37:23,681 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 16:37:23,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 16:37:23,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:23,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 16:37:23,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:37:40,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:38:14,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 16:38:14,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255992750] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:38:14,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:38:14,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 15 [2024-06-27 16:38:14,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530089985] [2024-06-27 16:38:14,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:38:14,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:38:14,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:38:14,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:38:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=178, Unknown=8, NotChecked=0, Total=240 [2024-06-27 16:38:14,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-27 16:38:14,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 584 transitions, 8342 flow. Second operand has 16 states, 16 states have (on average 12.6875) internal successors, (203), 16 states have internal predecessors, (203), 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 16:38:14,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:38:14,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-27 16:38:14,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:38:21,089 WARN L293 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 45 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:38:25,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:38:28,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:38:32,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:38:36,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:38:42,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:38:46,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:38:50,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:38:57,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:04,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:08,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:12,531 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 [] [2024-06-27 16:39:16,349 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 [] [2024-06-27 16:39:20,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:21,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:35,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:39,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:43,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:47,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:52,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:39:56,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:00,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:04,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:08,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 [] [2024-06-27 16:40:10,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:12,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:17,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:20,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:22,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:27,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:31,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:35,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:39,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:43,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:47,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:51,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:55,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:40:59,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:41:03,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:41:08,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:41:10,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:41:19,981 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 [] [2024-06-27 16:41:21,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:41:24,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:41:26,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15