./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.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-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 16:27:29,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 16:27:29,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 16:27:29,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 16:27:29,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 16:27:29,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 16:27:29,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 16:27:29,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 16:27:29,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 16:27:29,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 16:27:29,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 16:27:29,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 16:27:29,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 16:27:29,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 16:27:29,646 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 16:27:29,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 16:27:29,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 16:27:29,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 16:27:29,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 16:27:29,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 16:27:29,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 16:27:29,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 16:27:29,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 16:27:29,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 16:27:29,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 16:27:29,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 16:27:29,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 16:27:29,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 16:27:29,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 16:27:29,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 16:27:29,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 16:27:29,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 16:27:29,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:27:29,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 16:27:29,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 16:27:29,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 16:27:29,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 16:27:29,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 16:27:29,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 16:27:29,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 16:27:29,654 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 16:27:29,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 16:27:29,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 16:27:29,655 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2024-06-27 16:27:29,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 16:27:29,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 16:27:29,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 16:27:29,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 16:27:29,943 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 16:27:29,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-06-27 16:27:31,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 16:27:31,337 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 16:27:31,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-06-27 16:27:31,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e544190c3/2916ad029dd84df2af77b5bbafba8605/FLAG5d7976cb9 [2024-06-27 16:27:31,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e544190c3/2916ad029dd84df2af77b5bbafba8605 [2024-06-27 16:27:31,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 16:27:31,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 16:27:31,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 16:27:31,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 16:27:31,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 16:27:31,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d17c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31, skipping insertion in model container [2024-06-27 16:27:31,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,385 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 16:27:31,581 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-exp3x3-opt.wvr.c[2904,2917] [2024-06-27 16:27:31,588 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:27:31,606 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 16:27:31,626 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-exp3x3-opt.wvr.c[2904,2917] [2024-06-27 16:27:31,627 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 16:27:31,642 INFO L206 MainTranslator]: Completed translation [2024-06-27 16:27:31,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31 WrapperNode [2024-06-27 16:27:31,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 16:27:31,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 16:27:31,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 16:27:31,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 16:27:31,650 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:27:31" (1/1) ... [2024-06-27 16:27:31,658 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:27:31" (1/1) ... [2024-06-27 16:27:31,676 INFO L138 Inliner]: procedures = 24, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-06-27 16:27:31,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 16:27:31,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 16:27:31,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 16:27:31,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 16:27:31,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,716 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:27:31,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,722 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 16:27:31,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 16:27:31,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 16:27:31,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 16:27:31,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (1/1) ... [2024-06-27 16:27:31,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 16:27:31,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:27:31,769 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:27:31,779 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:27:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 16:27:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 16:27:31,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 16:27:31,813 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 16:27:31,813 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 16:27:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 16:27:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 16:27:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-06-27 16:27:31,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-06-27 16:27:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 16:27:31,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-06-27 16:27:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-06-27 16:27:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-06-27 16:27:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-06-27 16:27:31,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 16:27:31,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 16:27:31,817 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:27:31,897 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 16:27:31,899 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 16:27:32,102 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 16:27:32,103 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 16:27:32,266 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 16:27:32,266 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 16:27:32,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:27:32 BoogieIcfgContainer [2024-06-27 16:27:32,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 16:27:32,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 16:27:32,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 16:27:32,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 16:27:32,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 04:27:31" (1/3) ... [2024-06-27 16:27:32,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727ec669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:27:32, skipping insertion in model container [2024-06-27 16:27:32,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 04:27:31" (2/3) ... [2024-06-27 16:27:32,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@727ec669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 04:27:32, skipping insertion in model container [2024-06-27 16:27:32,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 04:27:32" (3/3) ... [2024-06-27 16:27:32,274 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-06-27 16:27:32,281 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 16:27:32,289 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 16:27:32,290 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 16:27:32,290 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 16:27:32,375 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-06-27 16:27:32,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 46 transitions, 134 flow [2024-06-27 16:27:32,443 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2024-06-27 16:27:32,443 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 16:27:32,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 6/40 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-06-27 16:27:32,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 46 transitions, 134 flow [2024-06-27 16:27:32,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 114 flow [2024-06-27 16:27:32,459 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 16:27:32,465 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;@1e919bcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 16:27:32,466 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 16:27:32,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 16:27:32,482 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2024-06-27 16:27:32,482 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 16:27:32,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:32,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:32,484 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 4 more)] === [2024-06-27 16:27:32,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1273891109, now seen corresponding path program 1 times [2024-06-27 16:27:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:32,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044753517] [2024-06-27 16:27:32,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:33,007 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:27:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044753517] [2024-06-27 16:27:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044753517] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:33,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:33,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:27:33,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227598027] [2024-06-27 16:27:33,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:33,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:27:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:33,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:27:33,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:27:33,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:33,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:33,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:33,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:33,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:35,266 INFO L124 PetriNetUnfolderBase]: 22467/26032 cut-off events. [2024-06-27 16:27:35,267 INFO L125 PetriNetUnfolderBase]: For 1291/1291 co-relation queries the response was YES. [2024-06-27 16:27:35,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53577 conditions, 26032 events. 22467/26032 cut-off events. For 1291/1291 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 90061 event pairs, 3392 based on Foata normal form. 1/14205 useless extension candidates. Maximal degree in co-relation 44055. Up to 18721 conditions per place. [2024-06-27 16:27:35,462 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 53 selfloop transitions, 3 changer transitions 5/68 dead transitions. [2024-06-27 16:27:35,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 327 flow [2024-06-27 16:27:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:27:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:27:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2024-06-27 16:27:35,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7318840579710145 [2024-06-27 16:27:35,477 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 114 flow. Second operand 3 states and 101 transitions. [2024-06-27 16:27:35,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 327 flow [2024-06-27 16:27:35,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 281 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 16:27:35,564 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 109 flow [2024-06-27 16:27:35,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-06-27 16:27:35,570 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2024-06-27 16:27:35,570 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 109 flow [2024-06-27 16:27:35,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:35,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:35,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:35,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 16:27:35,572 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 4 more)] === [2024-06-27 16:27:35,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:35,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1632091046, now seen corresponding path program 1 times [2024-06-27 16:27:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:35,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365398616] [2024-06-27 16:27:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:27:35,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:35,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365398616] [2024-06-27 16:27:35,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365398616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:35,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:35,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:27:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615381194] [2024-06-27 16:27:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:35,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:27:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:27:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:27:35,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:35,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:27:35,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:35,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:35,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:37,927 INFO L124 PetriNetUnfolderBase]: 28887/33823 cut-off events. [2024-06-27 16:27:37,927 INFO L125 PetriNetUnfolderBase]: For 5242/5242 co-relation queries the response was YES. [2024-06-27 16:27:38,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73953 conditions, 33823 events. 28887/33823 cut-off events. For 5242/5242 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 126061 event pairs, 5370 based on Foata normal form. 1/23088 useless extension candidates. Maximal degree in co-relation 30558. Up to 22060 conditions per place. [2024-06-27 16:27:38,173 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 53 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2024-06-27 16:27:38,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 286 flow [2024-06-27 16:27:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:27:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:27:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 16:27:38,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2024-06-27 16:27:38,175 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 109 flow. Second operand 3 states and 93 transitions. [2024-06-27 16:27:38,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 286 flow [2024-06-27 16:27:38,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:38,179 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 125 flow [2024-06-27 16:27:38,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-06-27 16:27:38,181 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2024-06-27 16:27:38,181 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 125 flow [2024-06-27 16:27:38,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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:27:38,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:38,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:38,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 16:27:38,182 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 4 more)] === [2024-06-27 16:27:38,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:38,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1847200297, now seen corresponding path program 1 times [2024-06-27 16:27:38,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:38,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281839166] [2024-06-27 16:27:38,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:27:38,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281839166] [2024-06-27 16:27:38,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281839166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:38,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:38,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 16:27:38,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754376022] [2024-06-27 16:27:38,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:38,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 16:27:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:38,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 16:27:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 16:27:38,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:38,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:27:38,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:38,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:38,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:40,979 INFO L124 PetriNetUnfolderBase]: 36445/42858 cut-off events. [2024-06-27 16:27:40,980 INFO L125 PetriNetUnfolderBase]: For 12374/12374 co-relation queries the response was YES. [2024-06-27 16:27:41,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100240 conditions, 42858 events. 36445/42858 cut-off events. For 12374/12374 co-relation queries the response was YES. Maximal size of possible extension queue 1536. Compared 168991 event pairs, 5856 based on Foata normal form. 1/35380 useless extension candidates. Maximal degree in co-relation 32750. Up to 31148 conditions per place. [2024-06-27 16:27:41,207 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 59 selfloop transitions, 3 changer transitions 3/72 dead transitions. [2024-06-27 16:27:41,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 340 flow [2024-06-27 16:27:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 16:27:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 16:27:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-06-27 16:27:41,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7028985507246377 [2024-06-27 16:27:41,213 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 125 flow. Second operand 3 states and 97 transitions. [2024-06-27 16:27:41,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 340 flow [2024-06-27 16:27:41,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:41,218 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 141 flow [2024-06-27 16:27:41,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2024-06-27 16:27:41,220 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2024-06-27 16:27:41,220 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 141 flow [2024-06-27 16:27:41,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:27:41,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:41,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:41,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 16:27:41,221 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 4 more)] === [2024-06-27 16:27:41,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1539604524, now seen corresponding path program 1 times [2024-06-27 16:27:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:41,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307711125] [2024-06-27 16:27:41,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:41,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:27:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307711125] [2024-06-27 16:27:41,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307711125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:27:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917383678] [2024-06-27 16:27:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:41,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:41,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:27:41,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:41,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:41,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:41,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:41,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:43,912 INFO L124 PetriNetUnfolderBase]: 41073/48677 cut-off events. [2024-06-27 16:27:43,912 INFO L125 PetriNetUnfolderBase]: For 18456/18456 co-relation queries the response was YES. [2024-06-27 16:27:43,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122495 conditions, 48677 events. 41073/48677 cut-off events. For 18456/18456 co-relation queries the response was YES. Maximal size of possible extension queue 1782. Compared 205151 event pairs, 6124 based on Foata normal form. 981/49144 useless extension candidates. Maximal degree in co-relation 40746. Up to 22914 conditions per place. [2024-06-27 16:27:44,132 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 106 selfloop transitions, 6 changer transitions 11/130 dead transitions. [2024-06-27 16:27:44,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 130 transitions, 643 flow [2024-06-27 16:27:44,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:27:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:27:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-06-27 16:27:44,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7608695652173914 [2024-06-27 16:27:44,137 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 141 flow. Second operand 5 states and 175 transitions. [2024-06-27 16:27:44,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 130 transitions, 643 flow [2024-06-27 16:27:44,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 130 transitions, 634 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:44,147 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 175 flow [2024-06-27 16:27:44,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-06-27 16:27:44,148 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-06-27 16:27:44,148 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 175 flow [2024-06-27 16:27:44,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:44,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:44,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:44,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 16:27:44,149 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 4 more)] === [2024-06-27 16:27:44,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:44,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1576941873, now seen corresponding path program 1 times [2024-06-27 16:27:44,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:44,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191888561] [2024-06-27 16:27:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:27:44,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191888561] [2024-06-27 16:27:44,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191888561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:44,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:44,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:27:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157636687] [2024-06-27 16:27:44,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:44,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:44,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:44,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:27:44,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:44,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:44,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:44,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:44,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:46,927 INFO L124 PetriNetUnfolderBase]: 40803/48295 cut-off events. [2024-06-27 16:27:46,927 INFO L125 PetriNetUnfolderBase]: For 30028/30028 co-relation queries the response was YES. [2024-06-27 16:27:47,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132577 conditions, 48295 events. 40803/48295 cut-off events. For 30028/30028 co-relation queries the response was YES. Maximal size of possible extension queue 1743. Compared 202039 event pairs, 973 based on Foata normal form. 562/48727 useless extension candidates. Maximal degree in co-relation 51811. Up to 18355 conditions per place. [2024-06-27 16:27:47,135 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 84 selfloop transitions, 4 changer transitions 35/130 dead transitions. [2024-06-27 16:27:47,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 130 transitions, 679 flow [2024-06-27 16:27:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:27:47,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:27:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2024-06-27 16:27:47,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7347826086956522 [2024-06-27 16:27:47,138 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 175 flow. Second operand 5 states and 169 transitions. [2024-06-27 16:27:47,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 130 transitions, 679 flow [2024-06-27 16:27:47,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 130 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:47,385 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 183 flow [2024-06-27 16:27:47,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-06-27 16:27:47,386 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2024-06-27 16:27:47,386 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 183 flow [2024-06-27 16:27:47,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:47,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:47,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:47,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 16:27:47,387 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 4 more)] === [2024-06-27 16:27:47,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1386392631, now seen corresponding path program 2 times [2024-06-27 16:27:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537503000] [2024-06-27 16:27:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:27:47,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:47,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537503000] [2024-06-27 16:27:47,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537503000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:47,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:47,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:27:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014864868] [2024-06-27 16:27:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:47,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:47,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:27:47,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:47,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:47,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:47,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:47,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:49,412 INFO L124 PetriNetUnfolderBase]: 28369/33687 cut-off events. [2024-06-27 16:27:49,413 INFO L125 PetriNetUnfolderBase]: For 38197/38197 co-relation queries the response was YES. [2024-06-27 16:27:49,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100041 conditions, 33687 events. 28369/33687 cut-off events. For 38197/38197 co-relation queries the response was YES. Maximal size of possible extension queue 1210. Compared 135687 event pairs, 3839 based on Foata normal form. 721/33997 useless extension candidates. Maximal degree in co-relation 51731. Up to 16437 conditions per place. [2024-06-27 16:27:49,560 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 112 selfloop transitions, 6 changer transitions 7/132 dead transitions. [2024-06-27 16:27:49,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 132 transitions, 776 flow [2024-06-27 16:27:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:27:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:27:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-06-27 16:27:49,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2024-06-27 16:27:49,562 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 183 flow. Second operand 5 states and 165 transitions. [2024-06-27 16:27:49,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 132 transitions, 776 flow [2024-06-27 16:27:49,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 132 transitions, 763 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:49,574 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 213 flow [2024-06-27 16:27:49,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-06-27 16:27:49,574 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2024-06-27 16:27:49,575 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 213 flow [2024-06-27 16:27:49,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:49,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:49,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:49,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 16:27:49,576 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 4 more)] === [2024-06-27 16:27:49,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1690910736, now seen corresponding path program 1 times [2024-06-27 16:27:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193187954] [2024-06-27 16:27:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 16:27:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193187954] [2024-06-27 16:27:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193187954] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:27:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369384664] [2024-06-27 16:27:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:27:49,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:27:49,736 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:27:49,738 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:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:49,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:27:49,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:27:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:27:49,967 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:27:49,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369384664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:27:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-06-27 16:27:49,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099374435] [2024-06-27 16:27:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:49,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:49,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:27:49,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:49,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:49,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:49,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:49,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:52,031 INFO L124 PetriNetUnfolderBase]: 27581/32810 cut-off events. [2024-06-27 16:27:52,031 INFO L125 PetriNetUnfolderBase]: For 37124/37124 co-relation queries the response was YES. [2024-06-27 16:27:52,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107692 conditions, 32810 events. 27581/32810 cut-off events. For 37124/37124 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 134456 event pairs, 1277 based on Foata normal form. 972/33634 useless extension candidates. Maximal degree in co-relation 47549. Up to 24879 conditions per place. [2024-06-27 16:27:52,165 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 93 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2024-06-27 16:27:52,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 104 transitions, 620 flow [2024-06-27 16:27:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:27:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:27:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2024-06-27 16:27:52,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6847826086956522 [2024-06-27 16:27:52,167 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 213 flow. Second operand 4 states and 126 transitions. [2024-06-27 16:27:52,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 104 transitions, 620 flow [2024-06-27 16:27:52,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 104 transitions, 607 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:52,317 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 226 flow [2024-06-27 16:27:52,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2024-06-27 16:27:52,318 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2024-06-27 16:27:52,318 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 226 flow [2024-06-27 16:27:52,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 16:27:52,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:52,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:52,334 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:27:52,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:27:52,532 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 4 more)] === [2024-06-27 16:27:52,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:52,533 INFO L85 PathProgramCache]: Analyzing trace with hash 723661435, now seen corresponding path program 1 times [2024-06-27 16:27:52,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:52,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551317065] [2024-06-27 16:27:52,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:52,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:27:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551317065] [2024-06-27 16:27:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551317065] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:52,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:52,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:27:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769466750] [2024-06-27 16:27:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:52,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:52,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:52,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:52,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:27:52,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:52,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:27:52,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:52,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:52,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:54,478 INFO L124 PetriNetUnfolderBase]: 27237/32465 cut-off events. [2024-06-27 16:27:54,478 INFO L125 PetriNetUnfolderBase]: For 49547/49547 co-relation queries the response was YES. [2024-06-27 16:27:54,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111317 conditions, 32465 events. 27237/32465 cut-off events. For 49547/49547 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 130555 event pairs, 640 based on Foata normal form. 366/32708 useless extension candidates. Maximal degree in co-relation 76500. Up to 12761 conditions per place. [2024-06-27 16:27:54,625 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 92 selfloop transitions, 4 changer transitions 35/138 dead transitions. [2024-06-27 16:27:54,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 138 transitions, 886 flow [2024-06-27 16:27:54,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:27:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:27:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2024-06-27 16:27:54,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-06-27 16:27:54,627 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 226 flow. Second operand 5 states and 161 transitions. [2024-06-27 16:27:54,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 138 transitions, 886 flow [2024-06-27 16:27:54,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 138 transitions, 868 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:27:54,832 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 233 flow [2024-06-27 16:27:54,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-06-27 16:27:54,833 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-06-27 16:27:54,833 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 233 flow [2024-06-27 16:27:54,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:27:54,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:54,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:54,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 16:27:54,834 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 4 more)] === [2024-06-27 16:27:54,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 40113075, now seen corresponding path program 2 times [2024-06-27 16:27:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673506864] [2024-06-27 16:27:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:27:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673506864] [2024-06-27 16:27:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673506864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:54,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:54,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:27:54,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533098342] [2024-06-27 16:27:54,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:54,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:54,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:27:54,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:54,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:27:54,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:54,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:54,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:56,648 INFO L124 PetriNetUnfolderBase]: 19916/23877 cut-off events. [2024-06-27 16:27:56,649 INFO L125 PetriNetUnfolderBase]: For 50208/50208 co-relation queries the response was YES. [2024-06-27 16:27:56,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86031 conditions, 23877 events. 19916/23877 cut-off events. For 50208/50208 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 93369 event pairs, 3114 based on Foata normal form. 406/23843 useless extension candidates. Maximal degree in co-relation 59586. Up to 9135 conditions per place. [2024-06-27 16:27:56,750 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 122 selfloop transitions, 6 changer transitions 3/138 dead transitions. [2024-06-27 16:27:56,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 138 transitions, 961 flow [2024-06-27 16:27:56,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:27:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:27:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-06-27 16:27:56,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2024-06-27 16:27:56,752 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 233 flow. Second operand 5 states and 155 transitions. [2024-06-27 16:27:56,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 138 transitions, 961 flow [2024-06-27 16:27:56,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 138 transitions, 948 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:56,765 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 263 flow [2024-06-27 16:27:56,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2024-06-27 16:27:56,766 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 18 predicate places. [2024-06-27 16:27:56,766 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 263 flow [2024-06-27 16:27:56,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:27:56,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:56,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:56,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 16:27:56,767 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 4 more)] === [2024-06-27 16:27:56,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:56,768 INFO L85 PathProgramCache]: Analyzing trace with hash -87921704, now seen corresponding path program 1 times [2024-06-27 16:27:56,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:56,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638526725] [2024-06-27 16:27:56,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:56,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:27:56,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638526725] [2024-06-27 16:27:56,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638526725] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:27:56,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064815882] [2024-06-27 16:27:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:56,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:27:56,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:27:56,852 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:27:56,878 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:27:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:56,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 16:27:56,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:27:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:27:57,047 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 16:27:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064815882] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:57,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 16:27:57,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-06-27 16:27:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630932062] [2024-06-27 16:27:57,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:57,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:57,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:57,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 16:27:57,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:57,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:27:57,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:57,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:57,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:27:58,420 INFO L124 PetriNetUnfolderBase]: 19120/22901 cut-off events. [2024-06-27 16:27:58,421 INFO L125 PetriNetUnfolderBase]: For 45293/45293 co-relation queries the response was YES. [2024-06-27 16:27:58,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89587 conditions, 22901 events. 19120/22901 cut-off events. For 45293/45293 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 90712 event pairs, 677 based on Foata normal form. 796/23617 useless extension candidates. Maximal degree in co-relation 62527. Up to 16474 conditions per place. [2024-06-27 16:27:58,837 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 101 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2024-06-27 16:27:58,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 112 transitions, 776 flow [2024-06-27 16:27:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 16:27:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 16:27:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-06-27 16:27:58,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6630434782608695 [2024-06-27 16:27:58,843 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 263 flow. Second operand 4 states and 122 transitions. [2024-06-27 16:27:58,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 112 transitions, 776 flow [2024-06-27 16:27:58,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 112 transitions, 763 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 16:27:58,958 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 276 flow [2024-06-27 16:27:58,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=276, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2024-06-27 16:27:58,959 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 21 predicate places. [2024-06-27 16:27:58,959 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 276 flow [2024-06-27 16:27:58,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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:27:58,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:27:58,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:27:58,971 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:27:59,160 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,SelfDestructingSolverStorable9 [2024-06-27 16:27:59,161 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 4 more)] === [2024-06-27 16:27:59,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:27:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1866218337, now seen corresponding path program 1 times [2024-06-27 16:27:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:27:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761463919] [2024-06-27 16:27:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:27:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:27:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:27:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:27:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:27:59,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761463919] [2024-06-27 16:27:59,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761463919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:27:59,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:27:59,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:27:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954196973] [2024-06-27 16:27:59,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:27:59,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:27:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:27:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:27:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:27:59,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:27:59,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 276 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:27:59,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:27:59,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:27:59,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:28:00,722 INFO L124 PetriNetUnfolderBase]: 18917/22797 cut-off events. [2024-06-27 16:28:00,722 INFO L125 PetriNetUnfolderBase]: For 58406/58406 co-relation queries the response was YES. [2024-06-27 16:28:00,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93087 conditions, 22797 events. 18917/22797 cut-off events. For 58406/58406 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 87703 event pairs, 941 based on Foata normal form. 203/22722 useless extension candidates. Maximal degree in co-relation 65339. Up to 9092 conditions per place. [2024-06-27 16:28:00,847 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 100 selfloop transitions, 4 changer transitions 35/146 dead transitions. [2024-06-27 16:28:00,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 1081 flow [2024-06-27 16:28:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:28:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:28:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-27 16:28:00,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6652173913043479 [2024-06-27 16:28:00,851 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 276 flow. Second operand 5 states and 153 transitions. [2024-06-27 16:28:00,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 1081 flow [2024-06-27 16:28:00,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 146 transitions, 1063 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 16:28:00,992 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 283 flow [2024-06-27 16:28:00,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2024-06-27 16:28:00,992 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2024-06-27 16:28:00,992 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 283 flow [2024-06-27 16:28:00,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:28:00,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:28:00,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:28:00,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 16:28:00,993 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 4 more)] === [2024-06-27 16:28:00,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:28:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash 586226707, now seen corresponding path program 2 times [2024-06-27 16:28:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:28:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875182210] [2024-06-27 16:28:00,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:28:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:28:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:28:01,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:28:01,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:28:01,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875182210] [2024-06-27 16:28:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875182210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 16:28:01,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 16:28:01,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 16:28:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591464723] [2024-06-27 16:28:01,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 16:28:01,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 16:28:01,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:28:01,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 16:28:01,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 16:28:01,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:28:01,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:28:01,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:28:01,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:28:01,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:28:02,149 INFO L124 PetriNetUnfolderBase]: 12943/15646 cut-off events. [2024-06-27 16:28:02,149 INFO L125 PetriNetUnfolderBase]: For 39573/39573 co-relation queries the response was YES. [2024-06-27 16:28:02,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65404 conditions, 15646 events. 12943/15646 cut-off events. For 39573/39573 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 57566 event pairs, 942 based on Foata normal form. 404/15898 useless extension candidates. Maximal degree in co-relation 45945. Up to 10371 conditions per place. [2024-06-27 16:28:02,242 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 124 selfloop transitions, 6 changer transitions 0/137 dead transitions. [2024-06-27 16:28:02,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 137 transitions, 1026 flow [2024-06-27 16:28:02,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 16:28:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 16:28:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 146 transitions. [2024-06-27 16:28:02,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6347826086956522 [2024-06-27 16:28:02,244 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 283 flow. Second operand 5 states and 146 transitions. [2024-06-27 16:28:02,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 137 transitions, 1026 flow [2024-06-27 16:28:02,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 137 transitions, 1019 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 16:28:02,311 INFO L231 Difference]: Finished difference. Result has 80 places, 59 transitions, 317 flow [2024-06-27 16:28:02,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=80, PETRI_TRANSITIONS=59} [2024-06-27 16:28:02,312 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2024-06-27 16:28:02,312 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 59 transitions, 317 flow [2024-06-27 16:28:02,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:28:02,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:28:02,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:28:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 16:28:02,313 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 4 more)] === [2024-06-27 16:28:02,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:28:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2022024224, now seen corresponding path program 1 times [2024-06-27 16:28:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:28:02,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387468520] [2024-06-27 16:28:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:28:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:28:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:28:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:28:02,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:28:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387468520] [2024-06-27 16:28:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387468520] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:28:02,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458269986] [2024-06-27 16:28:02,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:28:02,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:28:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:28:02,805 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:28:02,826 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:28:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:28:03,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 16:28:03,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:28:49,587 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:29:43,348 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-06-27 16:29:49,043 WARN L293 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-06-27 16:30:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:30:57,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:31:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 16:31:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458269986] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:31:21,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:31:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 15 [2024-06-27 16:31:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924580326] [2024-06-27 16:31:21,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:31:21,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 16:31:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:31:21,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 16:31:21,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=180, Unknown=11, NotChecked=0, Total=240 [2024-06-27 16:31:21,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:31:21,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 59 transitions, 317 flow. Second operand has 16 states, 16 states have (on average 19.0) internal successors, (304), 16 states have internal predecessors, (304), 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:21,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:31:21,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:31:21,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:31:22,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:31:24,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:32:12,467 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:26,727 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:30,755 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:13,067 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:33,492 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:37,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:33:45,570 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 41 DAG size of output: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:34:19,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:34:20,416 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:34:42,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:34:47,303 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:56,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:35:03,256 WARN L293 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 55 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:35:30,537 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 32 DAG size of output: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:35:44,432 WARN L293 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 62 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:36:33,930 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 49 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-27 16:36:59,980 INFO L124 PetriNetUnfolderBase]: 106548/128793 cut-off events. [2024-06-27 16:36:59,980 INFO L125 PetriNetUnfolderBase]: For 395640/395640 co-relation queries the response was YES. [2024-06-27 16:37:00,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562886 conditions, 128793 events. 106548/128793 cut-off events. For 395640/395640 co-relation queries the response was YES. Maximal size of possible extension queue 3736. Compared 627545 event pairs, 1215 based on Foata normal form. 1283/130071 useless extension candidates. Maximal degree in co-relation 489451. Up to 22811 conditions per place. [2024-06-27 16:37:00,727 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 1265 selfloop transitions, 274 changer transitions 363/1909 dead transitions. [2024-06-27 16:37:00,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 1909 transitions, 15090 flow [2024-06-27 16:37:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-06-27 16:37:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2024-06-27 16:37:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 2129 transitions. [2024-06-27 16:37:00,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6907852044127191 [2024-06-27 16:37:00,741 INFO L175 Difference]: Start difference. First operand has 80 places, 59 transitions, 317 flow. Second operand 67 states and 2129 transitions. [2024-06-27 16:37:00,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 1909 transitions, 15090 flow [2024-06-27 16:37:02,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 1909 transitions, 14567 flow, removed 195 selfloop flow, removed 1 redundant places. [2024-06-27 16:37:02,385 INFO L231 Difference]: Finished difference. Result has 207 places, 370 transitions, 3658 flow [2024-06-27 16:37:02,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=3658, PETRI_PLACES=207, PETRI_TRANSITIONS=370} [2024-06-27 16:37:02,385 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 155 predicate places. [2024-06-27 16:37:02,386 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 370 transitions, 3658 flow [2024-06-27 16:37:02,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.0) internal successors, (304), 16 states have internal predecessors, (304), 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:02,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 16:37:02,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 16:37:02,564 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:37:02,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:02,764 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 4 more)] === [2024-06-27 16:37:02,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 16:37:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1590898654, now seen corresponding path program 2 times [2024-06-27 16:37:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 16:37:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049243158] [2024-06-27 16:37:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 16:37:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 16:37:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 16:37:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 16:37:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 16:37:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049243158] [2024-06-27 16:37:03,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049243158] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 16:37:03,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548265907] [2024-06-27 16:37:03,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 16:37:03,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 16:37:03,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 16:37:03,175 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:37:03,176 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:37:03,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 16:37:03,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 16:37:03,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 16:37:03,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 16:37:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:37:03,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 16:37:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 16:37:04,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548265907] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 16:37:04,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 16:37:04,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-06-27 16:37:04,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001252383] [2024-06-27 16:37:04,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 16:37:04,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 16:37:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 16:37:04,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 16:37:04,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-06-27 16:37:04,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 46 [2024-06-27 16:37:04,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 370 transitions, 3658 flow. Second operand has 13 states, 13 states have (on average 19.307692307692307) internal successors, (251), 13 states have internal predecessors, (251), 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:04,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 16:37:04,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 46 [2024-06-27 16:37:04,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 16:37:09,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:37:11,827 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:37:14,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:37:18,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-06-27 16:37:31,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []