./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/pthread/queue_longest.i -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 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:06:12,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:06:12,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:06:12,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:06:12,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:06:12,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:06:12,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:06:12,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:06:12,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:06:12,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:06:12,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:06:12,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:06:12,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:06:12,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:06:12,760 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:06:12,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:06:12,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:06:12,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:06:12,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:06:12,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:06:12,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:06:12,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:06:12,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:06:12,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:06:12,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:06:12,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:06:12,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:06:12,764 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:06:12,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:06:12,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:06:12,765 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:06:12,765 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:06:12,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:12,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:06:12,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:06:12,766 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:06:12,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:06:12,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:06:12,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:06:12,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:06:12,767 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:06:12,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:06:12,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:06:12,768 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 -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2024-01-27 16:06:12,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:06:12,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:06:12,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:06:12,972 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:06:12,972 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:06:12,973 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2024-01-27 16:06:14,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:06:14,235 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:06:14,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2024-01-27 16:06:14,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ed51373/07bdcc48c3384909ab3225f5189bda94/FLAGabff652bf [2024-01-27 16:06:14,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ed51373/07bdcc48c3384909ab3225f5189bda94 [2024-01-27 16:06:14,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:06:14,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:06:14,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:14,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:06:14,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:06:14,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2accf592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14, skipping insertion in model container [2024-01-27 16:06:14,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,333 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:06:14,716 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-01-27 16:06:14,735 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-01-27 16:06:14,737 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-01-27 16:06:14,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:14,758 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:06:14,839 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2024-01-27 16:06:14,855 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2024-01-27 16:06:14,864 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2024-01-27 16:06:14,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:06:14,912 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:06:14,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14 WrapperNode [2024-01-27 16:06:14,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:06:14,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:14,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:06:14,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:06:14,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,957 INFO L138 Inliner]: procedures = 275, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-01-27 16:06:14,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:06:14,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:06:14,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:06:14,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:06:14,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,992 INFO L175 MemorySlicer]: Split 47 memory accesses to 6 slices as follows [2, 2, 5, 2, 4, 32]. 68 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0, 0, 0]. The 20 writes are split as follows [0, 1, 0, 1, 3, 15]. [2024-01-27 16:06:14,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:14,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:15,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:15,003 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:15,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:15,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:15,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:06:15,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:06:15,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:06:15,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:06:15,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (1/1) ... [2024-01-27 16:06:15,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:06:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:15,062 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-01-27 16:06:15,094 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-01-27 16:06:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:06:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:06:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:06:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:06:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:06:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:06:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:06:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:06:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:06:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:06:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:06:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:06:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 16:06:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:06:15,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:06:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:06:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:06:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:06:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 16:06:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:06:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:06:15,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:06:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:06:15,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:06:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:06:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:06:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 16:06:15,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:06:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:06:15,124 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:06:15,236 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:06:15,238 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:06:15,499 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:06:15,499 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:06:15,782 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:06:15,782 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:06:15,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:15 BoogieIcfgContainer [2024-01-27 16:06:15,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:06:15,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:06:15,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:06:15,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:06:15,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:06:14" (1/3) ... [2024-01-27 16:06:15,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919ce8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:15, skipping insertion in model container [2024-01-27 16:06:15,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:06:14" (2/3) ... [2024-01-27 16:06:15,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7919ce8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:06:15, skipping insertion in model container [2024-01-27 16:06:15,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:15" (3/3) ... [2024-01-27 16:06:15,789 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-01-27 16:06:15,801 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:06:15,808 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:06:15,808 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-01-27 16:06:15,808 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:06:15,858 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:06:15,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 48 transitions, 110 flow [2024-01-27 16:06:15,915 INFO L124 PetriNetUnfolderBase]: 7/46 cut-off events. [2024-01-27 16:06:15,916 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:06:15,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 7/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-01-27 16:06:15,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 48 transitions, 110 flow [2024-01-27 16:06:15,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 44 transitions, 97 flow [2024-01-27 16:06:15,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:06:15,934 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;@51749f43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:06:15,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 16:06:15,936 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:06:15,936 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-01-27 16:06:15,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:06:15,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:15,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 16:06:15,937 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-01-27 16:06:15,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash 644995, now seen corresponding path program 1 times [2024-01-27 16:06:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:15,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394475428] [2024-01-27 16:06:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:15,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394475428] [2024-01-27 16:06:16,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394475428] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:16,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:06:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348645940] [2024-01-27 16:06:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-27 16:06:16,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:16,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-27 16:06:16,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-27 16:06:16,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:16,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 97 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:16,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:16,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:16,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:16,315 INFO L124 PetriNetUnfolderBase]: 435/787 cut-off events. [2024-01-27 16:06:16,315 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-27 16:06:16,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 787 events. 435/787 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3602 event pairs, 339 based on Foata normal form. 48/745 useless extension candidates. Maximal degree in co-relation 1440. Up to 713 conditions per place. [2024-01-27 16:06:16,321 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 32 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2024-01-27 16:06:16,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 151 flow [2024-01-27 16:06:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-27 16:06:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-27 16:06:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 55 transitions. [2024-01-27 16:06:16,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2024-01-27 16:06:16,331 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 97 flow. Second operand 2 states and 55 transitions. [2024-01-27 16:06:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 151 flow [2024-01-27 16:06:16,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:16,334 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 82 flow [2024-01-27 16:06:16,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2024-01-27 16:06:16,339 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2024-01-27 16:06:16,339 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 82 flow [2024-01-27 16:06:16,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:16,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:16,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:16,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:06:16,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:16,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 930513047, now seen corresponding path program 1 times [2024-01-27 16:06:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981572735] [2024-01-27 16:06:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:16,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981572735] [2024-01-27 16:06:16,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981572735] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:16,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:16,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:16,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995108078] [2024-01-27 16:06:16,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:16,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:16,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:16,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:16,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-27 16:06:16,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:16,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:16,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:16,662 INFO L124 PetriNetUnfolderBase]: 415/767 cut-off events. [2024-01-27 16:06:16,662 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-01-27 16:06:16,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 767 events. 415/767 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3602 event pairs, 312 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 1486. Up to 643 conditions per place. [2024-01-27 16:06:16,668 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 41 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-01-27 16:06:16,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 192 flow [2024-01-27 16:06:16,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:16,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-01-27 16:06:16,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-01-27 16:06:16,674 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 82 flow. Second operand 3 states and 74 transitions. [2024-01-27 16:06:16,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 192 flow [2024-01-27 16:06:16,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 16:06:16,678 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 84 flow [2024-01-27 16:06:16,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2024-01-27 16:06:16,679 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2024-01-27 16:06:16,679 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 84 flow [2024-01-27 16:06:16,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-01-27 16:06:16,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:16,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:16,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:06:16,685 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:16,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1218864957, now seen corresponding path program 1 times [2024-01-27 16:06:16,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:16,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831598532] [2024-01-27 16:06:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:16,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:16,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831598532] [2024-01-27 16:06:16,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831598532] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:16,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:16,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:06:16,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006257193] [2024-01-27 16:06:16,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:16,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:06:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:06:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:06:16,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:16,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:16,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:16,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:16,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:17,233 INFO L124 PetriNetUnfolderBase]: 690/1270 cut-off events. [2024-01-27 16:06:17,233 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-01-27 16:06:17,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 1270 events. 690/1270 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6368 event pairs, 74 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 2482. Up to 678 conditions per place. [2024-01-27 16:06:17,238 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 73 selfloop transitions, 10 changer transitions 3/93 dead transitions. [2024-01-27 16:06:17,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 93 transitions, 379 flow [2024-01-27 16:06:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:06:17,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:06:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-01-27 16:06:17,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-01-27 16:06:17,240 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 84 flow. Second operand 6 states and 148 transitions. [2024-01-27 16:06:17,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 93 transitions, 379 flow [2024-01-27 16:06:17,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 93 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:17,242 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 148 flow [2024-01-27 16:06:17,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-01-27 16:06:17,242 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2024-01-27 16:06:17,243 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 148 flow [2024-01-27 16:06:17,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:17,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:17,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:17,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:06:17,243 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:17,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1465531370, now seen corresponding path program 1 times [2024-01-27 16:06:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:17,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768248497] [2024-01-27 16:06:17,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:17,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:17,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768248497] [2024-01-27 16:06:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768248497] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:17,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:17,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:06:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020261865] [2024-01-27 16:06:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:17,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:17,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:17,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:17,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:17,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-01-27 16:06:17,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:17,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:17,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:17,413 INFO L124 PetriNetUnfolderBase]: 440/850 cut-off events. [2024-01-27 16:06:17,413 INFO L125 PetriNetUnfolderBase]: For 154/157 co-relation queries the response was YES. [2024-01-27 16:06:17,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 850 events. 440/850 cut-off events. For 154/157 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3776 event pairs, 226 based on Foata normal form. 30/855 useless extension candidates. Maximal degree in co-relation 1748. Up to 437 conditions per place. [2024-01-27 16:06:17,416 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 38 selfloop transitions, 4 changer transitions 4/52 dead transitions. [2024-01-27 16:06:17,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 225 flow [2024-01-27 16:06:17,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-01-27 16:06:17,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-01-27 16:06:17,418 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 148 flow. Second operand 3 states and 76 transitions. [2024-01-27 16:06:17,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 225 flow [2024-01-27 16:06:17,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 219 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:06:17,419 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 110 flow [2024-01-27 16:06:17,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-01-27 16:06:17,420 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2024-01-27 16:06:17,420 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 110 flow [2024-01-27 16:06:17,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-01-27 16:06:17,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:17,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:17,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:06:17,421 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:17,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 372742989, now seen corresponding path program 1 times [2024-01-27 16:06:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202655679] [2024-01-27 16:06:17,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202655679] [2024-01-27 16:06:17,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202655679] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:17,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:17,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:06:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878945403] [2024-01-27 16:06:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:17,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:06:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:06:17,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:06:17,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:17,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-27 16:06:17,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:17,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:17,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:17,571 INFO L124 PetriNetUnfolderBase]: 265/581 cut-off events. [2024-01-27 16:06:17,572 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-01-27 16:06:17,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 581 events. 265/581 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2363 event pairs, 91 based on Foata normal form. 32/602 useless extension candidates. Maximal degree in co-relation 1193. Up to 266 conditions per place. [2024-01-27 16:06:17,574 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 36 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2024-01-27 16:06:17,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 219 flow [2024-01-27 16:06:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:06:17,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:06:17,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-01-27 16:06:17,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-01-27 16:06:17,575 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 110 flow. Second operand 3 states and 73 transitions. [2024-01-27 16:06:17,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 219 flow [2024-01-27 16:06:17,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 209 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:17,577 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 112 flow [2024-01-27 16:06:17,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-01-27 16:06:17,578 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2024-01-27 16:06:17,578 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 112 flow [2024-01-27 16:06:17,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-01-27 16:06:17,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:17,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:17,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:06:17,578 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:17,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash -71368257, now seen corresponding path program 1 times [2024-01-27 16:06:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:17,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89357092] [2024-01-27 16:06:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:17,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:18,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:18,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89357092] [2024-01-27 16:06:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89357092] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:18,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:18,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118122596] [2024-01-27 16:06:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:18,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:18,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:18,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:18,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:18,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:18,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:18,770 INFO L124 PetriNetUnfolderBase]: 384/839 cut-off events. [2024-01-27 16:06:18,770 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-01-27 16:06:18,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 839 events. 384/839 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4112 event pairs, 78 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1820. Up to 288 conditions per place. [2024-01-27 16:06:18,774 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 68 selfloop transitions, 16 changer transitions 12/102 dead transitions. [2024-01-27 16:06:18,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 495 flow [2024-01-27 16:06:18,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 16:06:18,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 16:06:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2024-01-27 16:06:18,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-01-27 16:06:18,776 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 112 flow. Second operand 10 states and 196 transitions. [2024-01-27 16:06:18,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 495 flow [2024-01-27 16:06:18,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 102 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:06:18,781 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 221 flow [2024-01-27 16:06:18,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=221, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-01-27 16:06:18,784 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2024-01-27 16:06:18,784 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 221 flow [2024-01-27 16:06:18,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:18,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:18,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:18,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:06:18,785 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:18,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1053873883, now seen corresponding path program 2 times [2024-01-27 16:06:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:18,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325601943] [2024-01-27 16:06:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:19,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325601943] [2024-01-27 16:06:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325601943] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:19,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:19,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:19,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838018369] [2024-01-27 16:06:19,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:19,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:19,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:19,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:19,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:19,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:19,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 221 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:19,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:19,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:19,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:19,866 INFO L124 PetriNetUnfolderBase]: 486/1076 cut-off events. [2024-01-27 16:06:19,867 INFO L125 PetriNetUnfolderBase]: For 846/848 co-relation queries the response was YES. [2024-01-27 16:06:19,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2814 conditions, 1076 events. 486/1076 cut-off events. For 846/848 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5992 event pairs, 146 based on Foata normal form. 6/1061 useless extension candidates. Maximal degree in co-relation 2800. Up to 657 conditions per place. [2024-01-27 16:06:19,871 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 71 selfloop transitions, 16 changer transitions 3/96 dead transitions. [2024-01-27 16:06:19,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 584 flow [2024-01-27 16:06:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:06:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:06:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-01-27 16:06:19,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3912037037037037 [2024-01-27 16:06:19,872 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 221 flow. Second operand 9 states and 169 transitions. [2024-01-27 16:06:19,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 584 flow [2024-01-27 16:06:19,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 96 transitions, 568 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:19,876 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 373 flow [2024-01-27 16:06:19,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=373, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2024-01-27 16:06:19,876 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 26 predicate places. [2024-01-27 16:06:19,877 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 373 flow [2024-01-27 16:06:19,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:19,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:19,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:19,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:06:19,877 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:19,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:19,878 INFO L85 PathProgramCache]: Analyzing trace with hash 290882353, now seen corresponding path program 3 times [2024-01-27 16:06:19,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:19,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350715411] [2024-01-27 16:06:19,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:19,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350715411] [2024-01-27 16:06:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350715411] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102094766] [2024-01-27 16:06:20,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:20,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:20,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:20,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 373 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:20,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:20,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:20,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:21,118 INFO L124 PetriNetUnfolderBase]: 570/1225 cut-off events. [2024-01-27 16:06:21,118 INFO L125 PetriNetUnfolderBase]: For 1773/1775 co-relation queries the response was YES. [2024-01-27 16:06:21,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3580 conditions, 1225 events. 570/1225 cut-off events. For 1773/1775 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6646 event pairs, 58 based on Foata normal form. 16/1226 useless extension candidates. Maximal degree in co-relation 3560. Up to 321 conditions per place. [2024-01-27 16:06:21,124 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 92 selfloop transitions, 33 changer transitions 3/134 dead transitions. [2024-01-27 16:06:21,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 134 transitions, 912 flow [2024-01-27 16:06:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:06:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:06:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-01-27 16:06:21,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4045138888888889 [2024-01-27 16:06:21,126 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 373 flow. Second operand 12 states and 233 transitions. [2024-01-27 16:06:21,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 134 transitions, 912 flow [2024-01-27 16:06:21,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 134 transitions, 864 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-01-27 16:06:21,134 INFO L231 Difference]: Finished difference. Result has 86 places, 72 transitions, 508 flow [2024-01-27 16:06:21,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=508, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2024-01-27 16:06:21,134 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2024-01-27 16:06:21,134 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 508 flow [2024-01-27 16:06:21,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:21,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:21,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:21,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:06:21,135 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:21,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1405892769, now seen corresponding path program 4 times [2024-01-27 16:06:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:21,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252171104] [2024-01-27 16:06:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:21,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252171104] [2024-01-27 16:06:21,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252171104] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:06:21,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:06:21,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:06:21,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638592827] [2024-01-27 16:06:21,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:06:21,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:06:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:21,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:06:21,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:06:21,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 48 [2024-01-27 16:06:21,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 508 flow. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:21,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:21,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 48 [2024-01-27 16:06:21,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:22,209 INFO L124 PetriNetUnfolderBase]: 663/1442 cut-off events. [2024-01-27 16:06:22,209 INFO L125 PetriNetUnfolderBase]: For 3667/3667 co-relation queries the response was YES. [2024-01-27 16:06:22,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4729 conditions, 1442 events. 663/1442 cut-off events. For 3667/3667 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8052 event pairs, 142 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 4703. Up to 707 conditions per place. [2024-01-27 16:06:22,217 INFO L140 encePairwiseOnDemand]: 37/48 looper letters, 89 selfloop transitions, 25 changer transitions 3/123 dead transitions. [2024-01-27 16:06:22,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 990 flow [2024-01-27 16:06:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 16:06:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 16:06:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-01-27 16:06:22,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-01-27 16:06:22,218 INFO L175 Difference]: Start difference. First operand has 86 places, 72 transitions, 508 flow. Second operand 9 states and 177 transitions. [2024-01-27 16:06:22,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 990 flow [2024-01-27 16:06:22,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 123 transitions, 909 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-01-27 16:06:22,228 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 661 flow [2024-01-27 16:06:22,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=661, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2024-01-27 16:06:22,229 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2024-01-27 16:06:22,229 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 661 flow [2024-01-27 16:06:22,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:06:22,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:22,230 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:22,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:06:22,230 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:22,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2066467833, now seen corresponding path program 1 times [2024-01-27 16:06:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329436210] [2024-01-27 16:06:22,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:22,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:23,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329436210] [2024-01-27 16:06:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329436210] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533553813] [2024-01-27 16:06:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:23,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:23,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:23,077 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-01-27 16:06:23,095 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-01-27 16:06:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:23,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 39 conjunts are in the unsatisfiable core [2024-01-27 16:06:23,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:23,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-01-27 16:06:23,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-01-27 16:06:23,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-27 16:06:23,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-27 16:06:23,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2024-01-27 16:06:23,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2024-01-27 16:06:23,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-01-27 16:06:23,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-01-27 16:06:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:24,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:24,538 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:24,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:24,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:24,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:25,809 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:25,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:25,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:25,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:26,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:06:26,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-01-27 16:06:26,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:06:26,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-01-27 16:06:26,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:06:26,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-01-27 16:06:26,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:06:26,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-01-27 16:06:26,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:06:26,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-01-27 16:06:26,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:06:26,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-01-27 16:06:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:06:26,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-01-27 16:06:26,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:06:26,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-01-27 16:06:26,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:06:26,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-01-27 16:06:27,210 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:27,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:27,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:27,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:27,383 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-01-27 16:06:27,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 130 [2024-01-27 16:06:27,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:27,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 74 [2024-01-27 16:06:27,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-01-27 16:06:27,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:27,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 56 [2024-01-27 16:06:27,601 INFO L349 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2024-01-27 16:06:27,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 57 [2024-01-27 16:06:27,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:27,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2477 treesize of output 1361 [2024-01-27 16:06:27,963 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2024-01-27 16:06:27,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2322 treesize of output 1393 [2024-01-27 16:06:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:29,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533553813] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:29,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:06:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126613702] [2024-01-27 16:06:29,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:29,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:06:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:29,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:06:29,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:06:29,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:06:29,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 661 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:06:29,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:29,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:06:29,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:31,052 INFO L124 PetriNetUnfolderBase]: 889/1826 cut-off events. [2024-01-27 16:06:31,053 INFO L125 PetriNetUnfolderBase]: For 5499/5500 co-relation queries the response was YES. [2024-01-27 16:06:31,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 1826 events. 889/1826 cut-off events. For 5499/5500 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 10425 event pairs, 91 based on Foata normal form. 24/1838 useless extension candidates. Maximal degree in co-relation 6231. Up to 929 conditions per place. [2024-01-27 16:06:31,062 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 115 selfloop transitions, 57 changer transitions 3/180 dead transitions. [2024-01-27 16:06:31,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 180 transitions, 1527 flow [2024-01-27 16:06:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-01-27 16:06:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-01-27 16:06:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 274 transitions. [2024-01-27 16:06:31,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567708333333333 [2024-01-27 16:06:31,064 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 661 flow. Second operand 16 states and 274 transitions. [2024-01-27 16:06:31,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 180 transitions, 1527 flow [2024-01-27 16:06:31,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 180 transitions, 1418 flow, removed 49 selfloop flow, removed 2 redundant places. [2024-01-27 16:06:31,079 INFO L231 Difference]: Finished difference. Result has 113 places, 118 transitions, 1076 flow [2024-01-27 16:06:31,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1076, PETRI_PLACES=113, PETRI_TRANSITIONS=118} [2024-01-27 16:06:31,080 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2024-01-27 16:06:31,080 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 118 transitions, 1076 flow [2024-01-27 16:06:31,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:06:31,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:31,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:31,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 16:06:31,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-27 16:06:31,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:31,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash -973317135, now seen corresponding path program 2 times [2024-01-27 16:06:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:31,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703739561] [2024-01-27 16:06:31,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703739561] [2024-01-27 16:06:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703739561] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:32,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271239236] [2024-01-27 16:06:32,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 16:06:32,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:32,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:32,076 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-01-27 16:06:32,077 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-01-27 16:06:32,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:06:32,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:06:32,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 55 conjunts are in the unsatisfiable core [2024-01-27 16:06:32,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:32,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-01-27 16:06:32,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 131 [2024-01-27 16:06:32,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-27 16:06:32,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2024-01-27 16:06:32,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 55 [2024-01-27 16:06:33,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-01-27 16:06:33,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2024-01-27 16:06:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:33,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:33,288 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:33,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:33,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:33,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:34,574 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:34,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:34,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:34,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:36,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271239236] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:36,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:36,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-01-27 16:06:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803744530] [2024-01-27 16:06:36,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:36,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-01-27 16:06:36,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:36,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-01-27 16:06:36,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2024-01-27 16:06:37,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:06:37,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 118 transitions, 1076 flow. Second operand has 30 states, 30 states have (on average 11.366666666666667) internal successors, (341), 30 states have internal predecessors, (341), 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-01-27 16:06:37,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:37,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:06:37,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:39,777 INFO L124 PetriNetUnfolderBase]: 1360/2785 cut-off events. [2024-01-27 16:06:39,777 INFO L125 PetriNetUnfolderBase]: For 10794/10794 co-relation queries the response was YES. [2024-01-27 16:06:39,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10816 conditions, 2785 events. 1360/2785 cut-off events. For 10794/10794 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 16746 event pairs, 222 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 10778. Up to 1091 conditions per place. [2024-01-27 16:06:39,794 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 191 selfloop transitions, 62 changer transitions 3/261 dead transitions. [2024-01-27 16:06:39,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 261 transitions, 2475 flow [2024-01-27 16:06:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 16:06:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 16:06:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 343 transitions. [2024-01-27 16:06:39,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37609649122807015 [2024-01-27 16:06:39,799 INFO L175 Difference]: Start difference. First operand has 113 places, 118 transitions, 1076 flow. Second operand 19 states and 343 transitions. [2024-01-27 16:06:39,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 261 transitions, 2475 flow [2024-01-27 16:06:39,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 261 transitions, 2376 flow, removed 35 selfloop flow, removed 7 redundant places. [2024-01-27 16:06:39,828 INFO L231 Difference]: Finished difference. Result has 133 places, 151 transitions, 1556 flow [2024-01-27 16:06:39,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1556, PETRI_PLACES=133, PETRI_TRANSITIONS=151} [2024-01-27 16:06:39,829 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places. [2024-01-27 16:06:39,829 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 151 transitions, 1556 flow [2024-01-27 16:06:39,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 11.366666666666667) internal successors, (341), 30 states have internal predecessors, (341), 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-01-27 16:06:39,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:39,830 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:39,842 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-01-27 16:06:40,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-27 16:06:40,032 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:40,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:40,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1374215481, now seen corresponding path program 3 times [2024-01-27 16:06:40,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:40,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065305735] [2024-01-27 16:06:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:41,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065305735] [2024-01-27 16:06:41,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065305735] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:41,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350945045] [2024-01-27 16:06:41,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 16:06:41,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:41,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:41,007 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-01-27 16:06:41,011 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-01-27 16:06:41,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 16:06:41,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:06:41,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 30 conjunts are in the unsatisfiable core [2024-01-27 16:06:41,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:41,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-01-27 16:06:41,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-01-27 16:06:41,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-27 16:06:41,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-27 16:06:41,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 16:06:41,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-01-27 16:06:41,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-01-27 16:06:42,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-01-27 16:06:42,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2024-01-27 16:06:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:42,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:42,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:42,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:42,380 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:42,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:43,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:43,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:43,329 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:43,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:44,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:44,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:44,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-01-27 16:06:44,507 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:44,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:44,547 INFO L349 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2024-01-27 16:06:44,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 42 [2024-01-27 16:06:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:44,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350945045] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:44,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:06:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526150688] [2024-01-27 16:06:44,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:44,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:06:44,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:06:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:06:45,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:06:45,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 151 transitions, 1556 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:06:45,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:45,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:06:45,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:06:49,950 INFO L124 PetriNetUnfolderBase]: 1891/3864 cut-off events. [2024-01-27 16:06:49,950 INFO L125 PetriNetUnfolderBase]: For 21162/21162 co-relation queries the response was YES. [2024-01-27 16:06:49,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16473 conditions, 3864 events. 1891/3864 cut-off events. For 21162/21162 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 25483 event pairs, 208 based on Foata normal form. 0/3840 useless extension candidates. Maximal degree in co-relation 16425. Up to 815 conditions per place. [2024-01-27 16:06:49,975 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 202 selfloop transitions, 125 changer transitions 7/339 dead transitions. [2024-01-27 16:06:49,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 339 transitions, 3609 flow [2024-01-27 16:06:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 16:06:49,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 16:06:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 405 transitions. [2024-01-27 16:06:49,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2024-01-27 16:06:49,980 INFO L175 Difference]: Start difference. First operand has 133 places, 151 transitions, 1556 flow. Second operand 22 states and 405 transitions. [2024-01-27 16:06:49,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 339 transitions, 3609 flow [2024-01-27 16:06:50,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 339 transitions, 3480 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-01-27 16:06:50,033 INFO L231 Difference]: Finished difference. Result has 159 places, 202 transitions, 2511 flow [2024-01-27 16:06:50,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2511, PETRI_PLACES=159, PETRI_TRANSITIONS=202} [2024-01-27 16:06:50,035 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places. [2024-01-27 16:06:50,035 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 202 transitions, 2511 flow [2024-01-27 16:06:50,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:06:50,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:06:50,036 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:06:50,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-27 16:06:50,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:50,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:06:50,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:06:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -378291667, now seen corresponding path program 4 times [2024-01-27 16:06:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:06:50,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572965705] [2024-01-27 16:06:50,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:06:50,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:06:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:06:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:51,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:06:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572965705] [2024-01-27 16:06:51,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572965705] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:06:51,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706456004] [2024-01-27 16:06:51,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 16:06:51,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:06:51,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:06:51,023 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-01-27 16:06:51,052 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-01-27 16:06:51,200 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 16:06:51,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:06:51,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 31 conjunts are in the unsatisfiable core [2024-01-27 16:06:51,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:06:51,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-01-27 16:06:51,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-01-27 16:06:51,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-01-27 16:06:51,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-27 16:06:51,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-01-27 16:06:51,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-01-27 16:06:51,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-01-27 16:06:51,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2024-01-27 16:06:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:51,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:06:52,201 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:52,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:52,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:52,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:53,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:53,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:53,291 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:53,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:54,232 INFO L349 Elim1Store]: treesize reduction 16, result has 23.8 percent of original size [2024-01-27 16:06:54,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 56 [2024-01-27 16:06:54,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:54,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 70 [2024-01-27 16:06:54,314 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-01-27 16:06:54,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 130 [2024-01-27 16:06:54,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:54,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 74 [2024-01-27 16:06:54,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-01-27 16:06:54,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:54,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:06:54,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:06:54,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2355 treesize of output 1403 [2024-01-27 16:06:54,548 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2024-01-27 16:06:54,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1196 treesize of output 751 [2024-01-27 16:06:54,581 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:06:54,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:06:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:06:55,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706456004] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:06:55,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:06:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:06:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385583171] [2024-01-27 16:06:55,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:06:55,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:06:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:06:55,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:06:55,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:06:55,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:06:55,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 202 transitions, 2511 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:06:55,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:06:55,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:06:55,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:00,188 INFO L124 PetriNetUnfolderBase]: 2338/4763 cut-off events. [2024-01-27 16:07:00,188 INFO L125 PetriNetUnfolderBase]: For 46371/46371 co-relation queries the response was YES. [2024-01-27 16:07:00,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23817 conditions, 4763 events. 2338/4763 cut-off events. For 46371/46371 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 33032 event pairs, 190 based on Foata normal form. 0/4731 useless extension candidates. Maximal degree in co-relation 23757. Up to 1049 conditions per place. [2024-01-27 16:07:00,230 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 224 selfloop transitions, 130 changer transitions 5/364 dead transitions. [2024-01-27 16:07:00,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 364 transitions, 4773 flow [2024-01-27 16:07:00,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 16:07:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 16:07:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 346 transitions. [2024-01-27 16:07:00,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3793859649122807 [2024-01-27 16:07:00,235 INFO L175 Difference]: Start difference. First operand has 159 places, 202 transitions, 2511 flow. Second operand 19 states and 346 transitions. [2024-01-27 16:07:00,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 364 transitions, 4773 flow [2024-01-27 16:07:00,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 364 transitions, 4501 flow, removed 112 selfloop flow, removed 7 redundant places. [2024-01-27 16:07:00,379 INFO L231 Difference]: Finished difference. Result has 178 places, 235 transitions, 3198 flow [2024-01-27 16:07:00,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3198, PETRI_PLACES=178, PETRI_TRANSITIONS=235} [2024-01-27 16:07:00,381 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 134 predicate places. [2024-01-27 16:07:00,381 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 235 transitions, 3198 flow [2024-01-27 16:07:00,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:07:00,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:00,383 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:00,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:00,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:00,596 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:00,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:00,597 INFO L85 PathProgramCache]: Analyzing trace with hash 733600217, now seen corresponding path program 5 times [2024-01-27 16:07:00,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896081051] [2024-01-27 16:07:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:00,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896081051] [2024-01-27 16:07:01,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896081051] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026173] [2024-01-27 16:07:01,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 16:07:01,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:01,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:01,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 16:07:01,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 16:07:01,622 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 16:07:01,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 16:07:01,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 43 conjunts are in the unsatisfiable core [2024-01-27 16:07:01,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:01,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-01-27 16:07:01,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2024-01-27 16:07:01,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-01-27 16:07:01,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-01-27 16:07:01,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-01-27 16:07:02,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-01-27 16:07:02,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2024-01-27 16:07:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:02,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:02,789 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:02,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:02,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:02,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:03,718 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-01-27 16:07:03,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-01-27 16:07:03,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:07:03,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-01-27 16:07:04,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:07:04,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-01-27 16:07:04,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:07:04,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-01-27 16:07:04,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-01-27 16:07:04,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-01-27 16:07:04,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-01-27 16:07:04,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-01-27 16:07:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026173] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:05,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:05,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-01-27 16:07:05,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457682327] [2024-01-27 16:07:05,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:05,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-27 16:07:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:05,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-27 16:07:05,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2024-01-27 16:07:05,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 48 [2024-01-27 16:07:05,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 235 transitions, 3198 flow. Second operand has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:07:05,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:05,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 48 [2024-01-27 16:07:05,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:10,822 INFO L124 PetriNetUnfolderBase]: 2732/5578 cut-off events. [2024-01-27 16:07:10,822 INFO L125 PetriNetUnfolderBase]: For 71223/71223 co-relation queries the response was YES. [2024-01-27 16:07:10,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30199 conditions, 5578 events. 2732/5578 cut-off events. For 71223/71223 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 40670 event pairs, 626 based on Foata normal form. 10/5548 useless extension candidates. Maximal degree in co-relation 30130. Up to 3614 conditions per place. [2024-01-27 16:07:10,870 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 305 selfloop transitions, 69 changer transitions 3/382 dead transitions. [2024-01-27 16:07:10,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 382 transitions, 5437 flow [2024-01-27 16:07:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 16:07:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 16:07:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 352 transitions. [2024-01-27 16:07:10,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38596491228070173 [2024-01-27 16:07:10,872 INFO L175 Difference]: Start difference. First operand has 178 places, 235 transitions, 3198 flow. Second operand 19 states and 352 transitions. [2024-01-27 16:07:10,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 382 transitions, 5437 flow [2024-01-27 16:07:11,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 382 transitions, 5106 flow, removed 130 selfloop flow, removed 9 redundant places. [2024-01-27 16:07:11,099 INFO L231 Difference]: Finished difference. Result has 198 places, 275 transitions, 3922 flow [2024-01-27 16:07:11,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3027, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3922, PETRI_PLACES=198, PETRI_TRANSITIONS=275} [2024-01-27 16:07:11,100 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places. [2024-01-27 16:07:11,100 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 275 transitions, 3922 flow [2024-01-27 16:07:11,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.535714285714286) internal successors, (323), 28 states have internal predecessors, (323), 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-01-27 16:07:11,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:11,100 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:11,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:11,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-01-27 16:07:11,313 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:11,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1311861821, now seen corresponding path program 1 times [2024-01-27 16:07:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:11,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859049805] [2024-01-27 16:07:11,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:11,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:11,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:07:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:11,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:07:11,429 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:07:11,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-01-27 16:07:11,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-01-27 16:07:11,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-01-27 16:07:11,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-01-27 16:07:11,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-01-27 16:07:11,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-01-27 16:07:11,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-01-27 16:07:11,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 16:07:11,433 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:11,437 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:07:11,437 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:07:11,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:07:11 BasicIcfg [2024-01-27 16:07:11,508 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:07:11,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:07:11,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:07:11,509 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:07:11,509 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:06:15" (3/4) ... [2024-01-27 16:07:11,510 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:07:11,549 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:07:11,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:07:11,562 INFO L158 Benchmark]: Toolchain (without parser) took 57288.19ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 962.6MB). Free memory was 173.6MB in the beginning and 1.1GB in the end (delta: -926.6MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2024-01-27 16:07:11,562 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 92.7MB in the beginning and 92.6MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:07:11,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.69ms. Allocated memory is still 205.5MB. Free memory was 173.4MB in the beginning and 145.4MB in the end (delta: 28.0MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-01-27 16:07:11,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.76ms. Allocated memory is still 205.5MB. Free memory was 145.4MB in the beginning and 142.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:11,562 INFO L158 Benchmark]: Boogie Preprocessor took 55.51ms. Allocated memory is still 205.5MB. Free memory was 142.7MB in the beginning and 138.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 16:07:11,562 INFO L158 Benchmark]: RCFGBuilder took 768.72ms. Allocated memory is still 205.5MB. Free memory was 138.9MB in the beginning and 128.3MB in the end (delta: 10.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-01-27 16:07:11,562 INFO L158 Benchmark]: TraceAbstraction took 55724.50ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 962.6MB). Free memory was 128.3MB in the beginning and 1.1GB in the end (delta: -984.4MB). Peak memory consumption was 665.0MB. Max. memory is 16.1GB. [2024-01-27 16:07:11,563 INFO L158 Benchmark]: Witness Printer took 52.42ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:07:11,563 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 92.7MB in the beginning and 92.6MB in the end (delta: 72.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.69ms. Allocated memory is still 205.5MB. Free memory was 173.4MB in the beginning and 145.4MB in the end (delta: 28.0MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.76ms. Allocated memory is still 205.5MB. Free memory was 145.4MB in the beginning and 142.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.51ms. Allocated memory is still 205.5MB. Free memory was 142.7MB in the beginning and 138.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 768.72ms. Allocated memory is still 205.5MB. Free memory was 138.9MB in the beginning and 128.3MB in the end (delta: 10.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55724.50ms. Allocated memory was 205.5MB in the beginning and 1.2GB in the end (delta: 962.6MB). Free memory was 128.3MB in the beginning and 1.1GB in the end (delta: -984.4MB). Peak memory consumption was 665.0MB. Max. memory is 16.1GB. * Witness Printer took 52.42ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(800)]; [L949] 0 int stored_elements[(800)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={7:0}, id2={6:0}, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1014] COND FALSE 1 !(empty(&queue)) [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i=0 VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1018] COND TRUE 1 i<((800)-1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=9] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (800)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1037] COND TRUE 2 i<(800) VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (800)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [arg={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1062]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 72 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 55.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 23.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1821 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1778 mSDsluCounter, 1130 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1103 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9266 IncrementalHoareTripleChecker+Invalid, 9397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 27 mSDtfsCounter, 9266 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 443 GetRequests, 208 SyntacticMatches, 2 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3922occurred in iteration=14, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 474 NumberOfCodeBlocks, 474 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 565 ConstructedInterpolants, 105 QuantifiedInterpolants, 84207 SizeOfPredicates, 207 NumberOfNonLiveVariables, 1400 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:07:11,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE