./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.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 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:22:05,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:22:05,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:22:05,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:22:05,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:22:05,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:22:05,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:22:05,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:22:05,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:22:05,353 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:22:05,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:22:05,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:22:05,354 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:22:05,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:22:05,355 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:22:05,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:22:05,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:22:05,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:22:05,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:22:05,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:22:05,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:22:05,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:22:05,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:22:05,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:22:05,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:22:05,357 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:22:05,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:22:05,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:22:05,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:22:05,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:22:05,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:22:05,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:22:05,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:22:05,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:22:05,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:22:05,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:22:05,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:22:05,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:22:05,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:22:05,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:22:05,360 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:22:05,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:22:05,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:22:05,361 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2024-06-27 17:22:05,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:22:05,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:22:05,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:22:05,598 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:22:05,598 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:22:05,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-06-27 17:22:06,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:22:06,825 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:22:06,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2024-06-27 17:22:06,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d98e703/92ea937314f44a91923c0973200b73d0/FLAGb2b34109c [2024-06-27 17:22:06,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6d98e703/92ea937314f44a91923c0973200b73d0 [2024-06-27 17:22:06,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:22:06,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:22:06,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:22:06,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:22:06,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:22:06,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:22:06" (1/1) ... [2024-06-27 17:22:06,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703c860e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:06, skipping insertion in model container [2024-06-27 17:22:06,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:22:06" (1/1) ... [2024-06-27 17:22:06,910 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:22:07,262 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-06-27 17:22:07,268 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-06-27 17:22:07,273 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-06-27 17:22:07,277 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:22:07,287 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:22:07,330 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-06-27 17:22:07,331 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-06-27 17:22:07,333 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-06-27 17:22:07,334 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:22:07,417 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:22:07,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07 WrapperNode [2024-06-27 17:22:07,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:22:07,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:22:07,421 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:22:07,421 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:22:07,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,483 INFO L138 Inliner]: procedures = 274, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-06-27 17:22:07,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:22:07,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:22:07,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:22:07,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:22:07,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,541 INFO L175 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 5, 4, 32]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 18 writes are split as follows [0, 0, 3, 15]. [2024-06-27 17:22:07,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:22:07,555 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:22:07,556 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:22:07,556 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:22:07,556 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (1/1) ... [2024-06-27 17:22:07,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:22:07,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:07,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:22:07,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:22:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 17:22:07,627 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 17:22:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 17:22:07,627 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 17:22:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 17:22:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:22:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:22:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:22:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 17:22:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:22:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:22:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:22:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 17:22:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 17:22:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:22:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:22:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:22:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:22:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 17:22:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:22:07,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:22:07,634 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:22:07,753 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:22:07,755 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:22:08,015 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:22:08,015 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:22:08,224 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:22:08,224 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 17:22:08,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:22:08 BoogieIcfgContainer [2024-06-27 17:22:08,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:22:08,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:22:08,227 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:22:08,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:22:08,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:22:06" (1/3) ... [2024-06-27 17:22:08,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3281496f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:22:08, skipping insertion in model container [2024-06-27 17:22:08,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:22:07" (2/3) ... [2024-06-27 17:22:08,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3281496f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:22:08, skipping insertion in model container [2024-06-27 17:22:08,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:22:08" (3/3) ... [2024-06-27 17:22:08,232 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-06-27 17:22:08,238 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:22:08,244 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:22:08,245 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 17:22:08,245 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:22:08,315 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:22:08,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2024-06-27 17:22:08,363 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2024-06-27 17:22:08,363 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:22:08,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 45 events. 7/45 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/35 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-27 17:22:08,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2024-06-27 17:22:08,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2024-06-27 17:22:08,383 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:22:08,389 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;@31e99539, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:22:08,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 17:22:08,392 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:22:08,392 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 17:22:08,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:22:08,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:08,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 17:22:08,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:08,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 634039, now seen corresponding path program 1 times [2024-06-27 17:22:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979040494] [2024-06-27 17:22:08,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:08,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-06-27 17:22:08,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:08,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979040494] [2024-06-27 17:22:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979040494] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:08,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:22:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862595124] [2024-06-27 17:22:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:08,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 17:22:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 17:22:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 17:22:08,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:08,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 95 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-06-27 17:22:08,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:08,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:08,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:08,723 INFO L124 PetriNetUnfolderBase]: 425/768 cut-off events. [2024-06-27 17:22:08,723 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-06-27 17:22:08,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 768 events. 425/768 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3474 event pairs, 331 based on Foata normal form. 47/726 useless extension candidates. Maximal degree in co-relation 1440. Up to 694 conditions per place. [2024-06-27 17:22:08,732 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-06-27 17:22:08,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2024-06-27 17:22:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 17:22:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 17:22:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-06-27 17:22:08,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-06-27 17:22:08,745 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2024-06-27 17:22:08,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2024-06-27 17:22:08,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:22:08,750 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2024-06-27 17:22:08,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2024-06-27 17:22:08,754 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-06-27 17:22:08,754 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2024-06-27 17:22:08,754 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-06-27 17:22:08,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:08,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:08,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:22:08,755 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-06-27 17:22:08,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1778644364, now seen corresponding path program 1 times [2024-06-27 17:22:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:08,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108250996] [2024-06-27 17:22:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:08,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108250996] [2024-06-27 17:22:08,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108250996] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:08,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:08,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:22:08,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140200399] [2024-06-27 17:22:08,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:08,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:22:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:22:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:22:08,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:08,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 80 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-06-27 17:22:08,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:08,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:08,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:09,050 INFO L124 PetriNetUnfolderBase]: 405/748 cut-off events. [2024-06-27 17:22:09,050 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-06-27 17:22:09,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 748 events. 405/748 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3491 event pairs, 304 based on Foata normal form. 0/680 useless extension candidates. Maximal degree in co-relation 1448. Up to 624 conditions per place. [2024-06-27 17:22:09,054 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-06-27 17:22:09,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2024-06-27 17:22:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:22:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:22:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-27 17:22:09,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-06-27 17:22:09,057 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2024-06-27 17:22:09,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2024-06-27 17:22:09,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:22:09,060 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2024-06-27 17:22:09,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2024-06-27 17:22:09,061 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-06-27 17:22:09,063 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2024-06-27 17:22:09,064 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-06-27 17:22:09,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:09,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:09,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:22:09,065 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-06-27 17:22:09,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash -696597918, now seen corresponding path program 1 times [2024-06-27 17:22:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:09,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620120244] [2024-06-27 17:22:09,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:09,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:09,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620120244] [2024-06-27 17:22:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620120244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:22:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400342308] [2024-06-27 17:22:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:09,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:22:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:22:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:22:09,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:09,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 82 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-06-27 17:22:09,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:09,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:09,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:09,687 INFO L124 PetriNetUnfolderBase]: 674/1239 cut-off events. [2024-06-27 17:22:09,687 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-06-27 17:22:09,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 1239 events. 674/1239 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6161 event pairs, 74 based on Foata normal form. 0/1178 useless extension candidates. Maximal degree in co-relation 2421. Up to 658 conditions per place. [2024-06-27 17:22:09,692 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 71 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2024-06-27 17:22:09,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 371 flow [2024-06-27 17:22:09,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:22:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:22:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-06-27 17:22:09,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-06-27 17:22:09,698 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 146 transitions. [2024-06-27 17:22:09,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 371 flow [2024-06-27 17:22:09,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:22:09,701 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2024-06-27 17:22:09,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-06-27 17:22:09,702 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-06-27 17:22:09,702 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2024-06-27 17:22:09,703 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-06-27 17:22:09,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:09,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:09,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:22:09,703 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-06-27 17:22:09,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -343635105, now seen corresponding path program 1 times [2024-06-27 17:22:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:09,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579495551] [2024-06-27 17:22:09,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:09,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:09,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579495551] [2024-06-27 17:22:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579495551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:09,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:09,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:22:09,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54586708] [2024-06-27 17:22:09,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:09,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:22:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:09,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:22:09,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:22:09,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:09,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 146 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-06-27 17:22:09,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:09,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:09,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:09,913 INFO L124 PetriNetUnfolderBase]: 421/812 cut-off events. [2024-06-27 17:22:09,914 INFO L125 PetriNetUnfolderBase]: For 151/154 co-relation queries the response was YES. [2024-06-27 17:22:09,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 812 events. 421/812 cut-off events. For 151/154 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3544 event pairs, 215 based on Foata normal form. 28/816 useless extension candidates. Maximal degree in co-relation 1671. Up to 417 conditions per place. [2024-06-27 17:22:09,918 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 3/50 dead transitions. [2024-06-27 17:22:09,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 217 flow [2024-06-27 17:22:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:22:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:22:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-27 17:22:09,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-06-27 17:22:09,919 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 74 transitions. [2024-06-27 17:22:09,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 217 flow [2024-06-27 17:22:09,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:22:09,921 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2024-06-27 17:22:09,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-27 17:22:09,922 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-06-27 17:22:09,922 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2024-06-27 17:22:09,922 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-06-27 17:22:09,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:09,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:22:09,923 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-06-27 17:22:09,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash -932670206, now seen corresponding path program 1 times [2024-06-27 17:22:09,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:09,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756256272] [2024-06-27 17:22:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:09,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:10,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:10,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756256272] [2024-06-27 17:22:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756256272] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:10,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:22:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706392238] [2024-06-27 17:22:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:10,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:22:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:10,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:22:10,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:22:10,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:10,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 108 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-06-27 17:22:10,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:10,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:10,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:10,089 INFO L124 PetriNetUnfolderBase]: 249/544 cut-off events. [2024-06-27 17:22:10,089 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-06-27 17:22:10,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 544 events. 249/544 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2170 event pairs, 85 based on Foata normal form. 32/566 useless extension candidates. Maximal degree in co-relation 1123. Up to 252 conditions per place. [2024-06-27 17:22:10,092 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-06-27 17:22:10,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 211 flow [2024-06-27 17:22:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:22:10,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:22:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-06-27 17:22:10,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-06-27 17:22:10,093 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 71 transitions. [2024-06-27 17:22:10,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 211 flow [2024-06-27 17:22:10,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 201 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 17:22:10,095 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2024-06-27 17:22:10,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-27 17:22:10,096 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-06-27 17:22:10,096 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2024-06-27 17:22:10,096 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-06-27 17:22:10,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:10,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:10,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:22:10,097 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-06-27 17:22:10,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:10,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1884471650, now seen corresponding path program 1 times [2024-06-27 17:22:10,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:10,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286535851] [2024-06-27 17:22:10,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:11,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:11,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286535851] [2024-06-27 17:22:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286535851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:11,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:11,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082051691] [2024-06-27 17:22:11,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:11,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:11,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:11,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:11,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:11,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:11,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 110 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-06-27 17:22:11,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:11,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:11,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:11,531 INFO L124 PetriNetUnfolderBase]: 357/783 cut-off events. [2024-06-27 17:22:11,532 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2024-06-27 17:22:11,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 783 events. 357/783 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3771 event pairs, 76 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1698. Up to 264 conditions per place. [2024-06-27 17:22:11,534 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 65 selfloop transitions, 14 changer transitions 8/93 dead transitions. [2024-06-27 17:22:11,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 455 flow [2024-06-27 17:22:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:22:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:22:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 17:22:11,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2024-06-27 17:22:11,536 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 9 states and 177 transitions. [2024-06-27 17:22:11,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 455 flow [2024-06-27 17:22:11,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:22:11,538 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 202 flow [2024-06-27 17:22:11,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2024-06-27 17:22:11,539 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-06-27 17:22:11,539 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 202 flow [2024-06-27 17:22:11,539 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-06-27 17:22:11,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:11,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:11,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:22:11,540 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-06-27 17:22:11,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1148633570, now seen corresponding path program 2 times [2024-06-27 17:22:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386315441] [2024-06-27 17:22:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:11,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:12,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386315441] [2024-06-27 17:22:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386315441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:12,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622433707] [2024-06-27 17:22:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:12,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:12,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:12,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:12,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:12,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 202 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-06-27 17:22:12,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:12,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:12,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:12,623 INFO L124 PetriNetUnfolderBase]: 517/1162 cut-off events. [2024-06-27 17:22:12,623 INFO L125 PetriNetUnfolderBase]: For 911/913 co-relation queries the response was YES. [2024-06-27 17:22:12,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 1162 events. 517/1162 cut-off events. For 911/913 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6633 event pairs, 120 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 3020. Up to 597 conditions per place. [2024-06-27 17:22:12,629 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 72 selfloop transitions, 21 changer transitions 4/103 dead transitions. [2024-06-27 17:22:12,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 103 transitions, 629 flow [2024-06-27 17:22:12,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:22:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:22:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-27 17:22:12,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41134751773049644 [2024-06-27 17:22:12,630 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 202 flow. Second operand 9 states and 174 transitions. [2024-06-27 17:22:12,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 103 transitions, 629 flow [2024-06-27 17:22:12,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 103 transitions, 609 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 17:22:12,634 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 391 flow [2024-06-27 17:22:12,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=391, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-27 17:22:12,635 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places. [2024-06-27 17:22:12,635 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 391 flow [2024-06-27 17:22:12,635 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-06-27 17:22:12,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:12,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:12,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:22:12,636 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-06-27 17:22:12,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1522221040, now seen corresponding path program 3 times [2024-06-27 17:22:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448148300] [2024-06-27 17:22:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:12,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:13,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:13,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:13,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448148300] [2024-06-27 17:22:13,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448148300] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:13,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147858749] [2024-06-27 17:22:13,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:13,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:13,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:13,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:13,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:13,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 391 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-06-27 17:22:13,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:13,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:13,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:13,652 INFO L124 PetriNetUnfolderBase]: 574/1267 cut-off events. [2024-06-27 17:22:13,653 INFO L125 PetriNetUnfolderBase]: For 1758/1758 co-relation queries the response was YES. [2024-06-27 17:22:13,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3646 conditions, 1267 events. 574/1267 cut-off events. For 1758/1758 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 7035 event pairs, 83 based on Foata normal form. 28/1284 useless extension candidates. Maximal degree in co-relation 3630. Up to 310 conditions per place. [2024-06-27 17:22:13,659 INFO L140 encePairwiseOnDemand]: 35/47 looper letters, 85 selfloop transitions, 29 changer transitions 2/122 dead transitions. [2024-06-27 17:22:13,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 122 transitions, 889 flow [2024-06-27 17:22:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:22:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:22:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2024-06-27 17:22:13,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42080378250591016 [2024-06-27 17:22:13,661 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 391 flow. Second operand 9 states and 178 transitions. [2024-06-27 17:22:13,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 122 transitions, 889 flow [2024-06-27 17:22:13,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 122 transitions, 829 flow, removed 30 selfloop flow, removed 0 redundant places. [2024-06-27 17:22:13,668 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 514 flow [2024-06-27 17:22:13,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=514, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2024-06-27 17:22:13,669 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2024-06-27 17:22:13,669 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 514 flow [2024-06-27 17:22:13,669 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-06-27 17:22:13,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:13,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:13,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:22:13,670 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-06-27 17:22:13,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:13,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1864737136, now seen corresponding path program 4 times [2024-06-27 17:22:13,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158412303] [2024-06-27 17:22:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:14,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:14,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158412303] [2024-06-27 17:22:14,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158412303] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:14,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:14,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748826636] [2024-06-27 17:22:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:14,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:14,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:14,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:14,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:14,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:14,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 514 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-06-27 17:22:14,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:14,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:14,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:14,769 INFO L124 PetriNetUnfolderBase]: 625/1376 cut-off events. [2024-06-27 17:22:14,770 INFO L125 PetriNetUnfolderBase]: For 2878/2878 co-relation queries the response was YES. [2024-06-27 17:22:14,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4301 conditions, 1376 events. 625/1376 cut-off events. For 2878/2878 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7851 event pairs, 128 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 4280. Up to 676 conditions per place. [2024-06-27 17:22:14,778 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 98 selfloop transitions, 25 changer transitions 2/131 dead transitions. [2024-06-27 17:22:14,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 1021 flow [2024-06-27 17:22:14,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:22:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:22:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 215 transitions. [2024-06-27 17:22:14,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38120567375886527 [2024-06-27 17:22:14,779 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 514 flow. Second operand 12 states and 215 transitions. [2024-06-27 17:22:14,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 1021 flow [2024-06-27 17:22:14,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 131 transitions, 957 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 17:22:14,788 INFO L231 Difference]: Finished difference. Result has 84 places, 81 transitions, 592 flow [2024-06-27 17:22:14,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=592, PETRI_PLACES=84, PETRI_TRANSITIONS=81} [2024-06-27 17:22:14,789 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2024-06-27 17:22:14,789 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 81 transitions, 592 flow [2024-06-27 17:22:14,789 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-06-27 17:22:14,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:14,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:14,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:22:14,790 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-06-27 17:22:14,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1075971134, now seen corresponding path program 5 times [2024-06-27 17:22:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337464454] [2024-06-27 17:22:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:15,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337464454] [2024-06-27 17:22:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337464454] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:22:15,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:22:15,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:22:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122915850] [2024-06-27 17:22:15,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:22:15,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:22:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:15,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:22:15,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:22:15,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-06-27 17:22:15,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 81 transitions, 592 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-06-27 17:22:15,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:15,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-06-27 17:22:15,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:15,900 INFO L124 PetriNetUnfolderBase]: 699/1542 cut-off events. [2024-06-27 17:22:15,901 INFO L125 PetriNetUnfolderBase]: For 3730/3730 co-relation queries the response was YES. [2024-06-27 17:22:15,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4965 conditions, 1542 events. 699/1542 cut-off events. For 3730/3730 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9081 event pairs, 154 based on Foata normal form. 0/1525 useless extension candidates. Maximal degree in co-relation 4941. Up to 767 conditions per place. [2024-06-27 17:22:15,909 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 98 selfloop transitions, 26 changer transitions 2/132 dead transitions. [2024-06-27 17:22:15,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 132 transitions, 1099 flow [2024-06-27 17:22:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:22:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:22:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-06-27 17:22:15,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39787234042553193 [2024-06-27 17:22:15,911 INFO L175 Difference]: Start difference. First operand has 84 places, 81 transitions, 592 flow. Second operand 10 states and 187 transitions. [2024-06-27 17:22:15,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 132 transitions, 1099 flow [2024-06-27 17:22:15,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 132 transitions, 1023 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 17:22:15,922 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 752 flow [2024-06-27 17:22:15,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=752, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2024-06-27 17:22:15,923 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2024-06-27 17:22:15,923 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 752 flow [2024-06-27 17:22:15,923 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-06-27 17:22:15,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:15,924 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-06-27 17:22:15,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:22:15,924 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-06-27 17:22:15,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:15,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1909824166, now seen corresponding path program 1 times [2024-06-27 17:22:15,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:15,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896329501] [2024-06-27 17:22:15,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896329501] [2024-06-27 17:22:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896329501] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815505263] [2024-06-27 17:22:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:16,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:16,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:16,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:22:16,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:22:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:16,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 55 conjunts are in the unsatisfiable core [2024-06-27 17:22:16,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:16,956 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 22 treesize of output 21 [2024-06-27 17:22:17,088 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 201 treesize of output 183 [2024-06-27 17:22:17,094 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 33 treesize of output 22 [2024-06-27 17:22:17,146 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-06-27 17:22:17,370 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 141 treesize of output 135 [2024-06-27 17:22:17,377 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-06-27 17:22:17,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:17,382 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 55 treesize of output 54 [2024-06-27 17:22:17,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:17,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:17,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 47 [2024-06-27 17:22:17,796 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 79 treesize of output 65 [2024-06-27 17:22:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:17,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:18,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:18,296 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-06-27 17:22:18,306 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:18,307 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-06-27 17:22:19,831 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:19,832 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-06-27 17:22:19,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:19,841 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-06-27 17:22:24,918 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 23 treesize of output 21 [2024-06-27 17:22:24,925 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 126 treesize of output 114 [2024-06-27 17:22:24,980 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 23 treesize of output 21 [2024-06-27 17:22:24,985 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 60 treesize of output 54 [2024-06-27 17:22:25,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-06-27 17:22:25,028 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 126 treesize of output 114 [2024-06-27 17:22:25,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 23 treesize of output 21 [2024-06-27 17:22:25,069 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 126 treesize of output 114 [2024-06-27 17:22:25,115 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-06-27 17:22:25,118 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-06-27 17:22:25,129 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-06-27 17:22:25,132 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-06-27 17:22:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815505263] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:29,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:29,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-06-27 17:22:29,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803512377] [2024-06-27 17:22:29,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:29,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-06-27 17:22:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:29,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-06-27 17:22:29,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=700, Unknown=1, NotChecked=0, Total=870 [2024-06-27 17:22:33,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:38,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:38,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-06-27 17:22:38,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 752 flow. Second operand has 30 states, 30 states have (on average 9.666666666666666) internal successors, (290), 30 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:38,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:38,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-06-27 17:22:38,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:39,943 INFO L124 PetriNetUnfolderBase]: 1455/2691 cut-off events. [2024-06-27 17:22:39,943 INFO L125 PetriNetUnfolderBase]: For 7284/7284 co-relation queries the response was YES. [2024-06-27 17:22:39,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8799 conditions, 2691 events. 1455/2691 cut-off events. For 7284/7284 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15125 event pairs, 274 based on Foata normal form. 18/2700 useless extension candidates. Maximal degree in co-relation 8770. Up to 1464 conditions per place. [2024-06-27 17:22:39,960 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 126 selfloop transitions, 56 changer transitions 4/189 dead transitions. [2024-06-27 17:22:39,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 189 transitions, 1607 flow [2024-06-27 17:22:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:22:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:22:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 227 transitions. [2024-06-27 17:22:39,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34498480243161095 [2024-06-27 17:22:39,962 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 752 flow. Second operand 14 states and 227 transitions. [2024-06-27 17:22:39,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 189 transitions, 1607 flow [2024-06-27 17:22:39,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 189 transitions, 1486 flow, removed 55 selfloop flow, removed 3 redundant places. [2024-06-27 17:22:39,981 INFO L231 Difference]: Finished difference. Result has 108 places, 119 transitions, 1159 flow [2024-06-27 17:22:39,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1159, PETRI_PLACES=108, PETRI_TRANSITIONS=119} [2024-06-27 17:22:39,981 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places. [2024-06-27 17:22:39,982 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 119 transitions, 1159 flow [2024-06-27 17:22:39,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.666666666666666) internal successors, (290), 30 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:39,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:39,982 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-06-27 17:22:39,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:22:40,191 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,SelfDestructingSolverStorable10 [2024-06-27 17:22:40,191 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-06-27 17:22:40,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1270051366, now seen corresponding path program 2 times [2024-06-27 17:22:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621734427] [2024-06-27 17:22:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621734427] [2024-06-27 17:22:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621734427] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613282357] [2024-06-27 17:22:40,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:22:40,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:40,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:40,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:22:40,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 17:22:41,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:22:41,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:22:41,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjunts are in the unsatisfiable core [2024-06-27 17:22:41,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:41,243 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-06-27 17:22:41,288 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 102 treesize of output 96 [2024-06-27 17:22:41,292 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-06-27 17:22:41,310 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-06-27 17:22:41,548 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-06-27 17:22:41,551 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-06-27 17:22:41,981 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-06-27 17:22:41,983 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-06-27 17:22:42,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-06-27 17:22:42,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:42,225 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:42,225 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-06-27 17:22:42,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:42,268 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-06-27 17:22:43,198 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:43,198 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-06-27 17:22:43,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:43,247 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-06-27 17:22:44,394 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2024-06-27 17:22:44,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 622 treesize of output 409 [2024-06-27 17:22:44,434 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 17:22:44,445 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 17:22:44,452 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 17:22:44,468 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 17:22:44,480 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 17:22:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:44,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613282357] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:44,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:44,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:22:44,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936206921] [2024-06-27 17:22:44,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:44,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:22:44,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:44,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:22:44,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:22:45,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:22:45,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 119 transitions, 1159 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-06-27 17:22:45,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:45,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:22:45,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:48,130 INFO L124 PetriNetUnfolderBase]: 1267/2622 cut-off events. [2024-06-27 17:22:48,131 INFO L125 PetriNetUnfolderBase]: For 10770/10770 co-relation queries the response was YES. [2024-06-27 17:22:48,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9781 conditions, 2622 events. 1267/2622 cut-off events. For 10770/10770 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 16252 event pairs, 222 based on Foata normal form. 0/2608 useless extension candidates. Maximal degree in co-relation 9747. Up to 1063 conditions per place. [2024-06-27 17:22:48,145 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 171 selfloop transitions, 56 changer transitions 2/234 dead transitions. [2024-06-27 17:22:48,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 234 transitions, 2361 flow [2024-06-27 17:22:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:22:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:22:48,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 290 transitions. [2024-06-27 17:22:48,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38563829787234044 [2024-06-27 17:22:48,150 INFO L175 Difference]: Start difference. First operand has 108 places, 119 transitions, 1159 flow. Second operand 16 states and 290 transitions. [2024-06-27 17:22:48,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 234 transitions, 2361 flow [2024-06-27 17:22:48,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 234 transitions, 2310 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 17:22:48,168 INFO L231 Difference]: Finished difference. Result has 125 places, 146 transitions, 1632 flow [2024-06-27 17:22:48,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1632, PETRI_PLACES=125, PETRI_TRANSITIONS=146} [2024-06-27 17:22:48,168 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places. [2024-06-27 17:22:48,168 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 146 transitions, 1632 flow [2024-06-27 17:22:48,168 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-06-27 17:22:48,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:48,169 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-06-27 17:22:48,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 17:22:48,369 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,SelfDestructingSolverStorable11 [2024-06-27 17:22:48,369 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-06-27 17:22:48,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1032346684, now seen corresponding path program 3 times [2024-06-27 17:22:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740004993] [2024-06-27 17:22:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:49,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740004993] [2024-06-27 17:22:49,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740004993] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:49,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293229038] [2024-06-27 17:22:49,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:22:49,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:49,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:49,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:22:49,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 17:22:49,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:22:49,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:22:49,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2024-06-27 17:22:49,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:49,358 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-06-27 17:22:49,402 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 117 treesize of output 107 [2024-06-27 17:22:49,424 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-06-27 17:22:49,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:49,660 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 46 treesize of output 26 [2024-06-27 17:22:49,664 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-06-27 17:22:50,085 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-06-27 17:22:50,087 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-06-27 17:22:50,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:50,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:50,312 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:50,312 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-06-27 17:22:50,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:50,333 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-06-27 17:22:51,155 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:51,155 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-06-27 17:22:51,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:51,189 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-06-27 17:22:52,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:52,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 700 treesize of output 456 [2024-06-27 17:22:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:52,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293229038] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:52,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:52,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:22:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484309829] [2024-06-27 17:22:52,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:52,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:22:52,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:52,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:22:52,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:22:52,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:22:52,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 146 transitions, 1632 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-06-27 17:22:52,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:52,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:22:52,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:56,241 INFO L124 PetriNetUnfolderBase]: 1698/3485 cut-off events. [2024-06-27 17:22:56,241 INFO L125 PetriNetUnfolderBase]: For 20766/20766 co-relation queries the response was YES. [2024-06-27 17:22:56,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14553 conditions, 3485 events. 1698/3485 cut-off events. For 20766/20766 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23010 event pairs, 138 based on Foata normal form. 0/3464 useless extension candidates. Maximal degree in co-relation 14510. Up to 645 conditions per place. [2024-06-27 17:22:56,304 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 189 selfloop transitions, 124 changer transitions 6/324 dead transitions. [2024-06-27 17:22:56,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 324 transitions, 3674 flow [2024-06-27 17:22:56,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-06-27 17:22:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-06-27 17:22:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 395 transitions. [2024-06-27 17:22:56,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3820116054158607 [2024-06-27 17:22:56,307 INFO L175 Difference]: Start difference. First operand has 125 places, 146 transitions, 1632 flow. Second operand 22 states and 395 transitions. [2024-06-27 17:22:56,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 324 transitions, 3674 flow [2024-06-27 17:22:56,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 324 transitions, 3505 flow, removed 65 selfloop flow, removed 6 redundant places. [2024-06-27 17:22:56,346 INFO L231 Difference]: Finished difference. Result has 151 places, 192 transitions, 2541 flow [2024-06-27 17:22:56,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2541, PETRI_PLACES=151, PETRI_TRANSITIONS=192} [2024-06-27 17:22:56,346 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places. [2024-06-27 17:22:56,346 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 192 transitions, 2541 flow [2024-06-27 17:22:56,347 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-06-27 17:22:56,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:56,347 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-06-27 17:22:56,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:22:56,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:56,562 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-06-27 17:22:56,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:56,562 INFO L85 PathProgramCache]: Analyzing trace with hash -548353092, now seen corresponding path program 4 times [2024-06-27 17:22:56,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:56,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039201735] [2024-06-27 17:22:56,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039201735] [2024-06-27 17:22:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039201735] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408856703] [2024-06-27 17:22:57,257 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:22:57,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:57,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:57,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:22:57,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 17:22:57,400 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:22:57,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:22:57,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 45 conjunts are in the unsatisfiable core [2024-06-27 17:22:57,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:57,414 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-06-27 17:22:57,465 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-06-27 17:22:57,468 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 27 treesize of output 16 [2024-06-27 17:22:57,488 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-06-27 17:22:57,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:57,697 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 46 treesize of output 26 [2024-06-27 17:22:57,712 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-06-27 17:22:58,126 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-06-27 17:22:58,130 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-06-27 17:22:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:58,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:58,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:58,472 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-06-27 17:22:58,481 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:58,481 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-06-27 17:22:59,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:59,600 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-06-27 17:22:59,609 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:59,609 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-06-27 17:23:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:02,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408856703] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:23:02,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:23:02,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:23:02,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830581939] [2024-06-27 17:23:02,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:23:02,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:23:02,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:23:02,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:23:02,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:23:02,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 47 [2024-06-27 17:23:02,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 192 transitions, 2541 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-06-27 17:23:02,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:23:02,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 47 [2024-06-27 17:23:02,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:23:05,585 INFO L124 PetriNetUnfolderBase]: 2105/4304 cut-off events. [2024-06-27 17:23:05,585 INFO L125 PetriNetUnfolderBase]: For 39788/39788 co-relation queries the response was YES. [2024-06-27 17:23:05,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21054 conditions, 4304 events. 2105/4304 cut-off events. For 39788/39788 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 29756 event pairs, 133 based on Foata normal form. 0/4276 useless extension candidates. Maximal degree in co-relation 20999. Up to 953 conditions per place. [2024-06-27 17:23:05,618 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 214 selfloop transitions, 127 changer transitions 4/350 dead transitions. [2024-06-27 17:23:05,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 350 transitions, 4795 flow [2024-06-27 17:23:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 17:23:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 17:23:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 339 transitions. [2024-06-27 17:23:05,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3796192609182531 [2024-06-27 17:23:05,621 INFO L175 Difference]: Start difference. First operand has 151 places, 192 transitions, 2541 flow. Second operand 19 states and 339 transitions. [2024-06-27 17:23:05,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 350 transitions, 4795 flow [2024-06-27 17:23:05,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 350 transitions, 4494 flow, removed 113 selfloop flow, removed 9 redundant places. [2024-06-27 17:23:05,725 INFO L231 Difference]: Finished difference. Result has 168 places, 225 transitions, 3221 flow [2024-06-27 17:23:05,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2317, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3221, PETRI_PLACES=168, PETRI_TRANSITIONS=225} [2024-06-27 17:23:05,726 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places. [2024-06-27 17:23:05,727 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 225 transitions, 3221 flow [2024-06-27 17:23:05,727 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-06-27 17:23:05,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:23:05,727 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-06-27 17:23:05,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:23:05,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:23:05,939 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-06-27 17:23:05,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:23:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1154804914, now seen corresponding path program 5 times [2024-06-27 17:23:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:23:05,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127349183] [2024-06-27 17:23:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:23:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:23:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:23:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:06,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:23:06,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127349183] [2024-06-27 17:23:06,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127349183] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:23:06,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941448289] [2024-06-27 17:23:06,689 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:23:06,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:23:06,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:23:06,690 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:23:06,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 17:23:06,880 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:23:06,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:23:06,882 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 47 conjunts are in the unsatisfiable core [2024-06-27 17:23:06,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:23:06,894 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 22 treesize of output 21 [2024-06-27 17:23:06,940 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 155 treesize of output 145 [2024-06-27 17:23:06,945 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-06-27 17:23:06,994 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-06-27 17:23:07,126 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 141 treesize of output 135 [2024-06-27 17:23:07,130 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-06-27 17:23:07,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:23:07,135 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 69 treesize of output 49 [2024-06-27 17:23:07,357 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 53 treesize of output 45 [2024-06-27 17:23:07,359 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 59 treesize of output 49 [2024-06-27 17:23:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:07,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:23:07,617 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:23:07,617 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-06-27 17:23:07,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:07,629 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-06-27 17:23:12,610 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:23:12,610 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-06-27 17:23:12,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:12,617 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-06-27 17:23:13,744 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 23 treesize of output 21 [2024-06-27 17:23:13,747 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 126 treesize of output 114 [2024-06-27 17:23:13,768 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 23 treesize of output 21 [2024-06-27 17:23:13,770 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 60 treesize of output 54 [2024-06-27 17:23:13,782 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 23 treesize of output 21 [2024-06-27 17:23:13,785 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 126 treesize of output 114 [2024-06-27 17:23:13,801 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 23 treesize of output 21 [2024-06-27 17:23:13,804 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 60 treesize of output 54 [2024-06-27 17:23:13,819 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 23 treesize of output 21 [2024-06-27 17:23:13,821 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 126 treesize of output 114 [2024-06-27 17:23:13,833 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 19 treesize of output 17 [2024-06-27 17:23:13,839 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 23 treesize of output 21 [2024-06-27 17:23:13,841 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 60 treesize of output 54 [2024-06-27 17:23:13,863 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 23 treesize of output 21 [2024-06-27 17:23:13,866 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 126 treesize of output 114 [2024-06-27 17:23:13,886 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-06-27 17:23:13,888 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-06-27 17:23:13,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 15 treesize of output 13 [2024-06-27 17:23:13,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 24 treesize of output 18 [2024-06-27 17:23:14,394 INFO L349 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2024-06-27 17:23:14,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 1189 treesize of output 748 [2024-06-27 17:23:14,425 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 17:23:14,484 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:23:14,484 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-06-27 17:23:14,496 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-27 17:23:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:14,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941448289] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:23:14,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:23:14,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:23:14,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236301255] [2024-06-27 17:23:14,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:23:14,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:23:14,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:23:14,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:23:14,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=608, Unknown=1, NotChecked=0, Total=756 [2024-06-27 17:23:19,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:23,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:23,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-06-27 17:23:23,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 225 transitions, 3221 flow. Second operand has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:23:23,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:23:23,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-06-27 17:23:23,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:23:26,089 INFO L124 PetriNetUnfolderBase]: 3525/6463 cut-off events. [2024-06-27 17:23:26,089 INFO L125 PetriNetUnfolderBase]: For 63534/63534 co-relation queries the response was YES. [2024-06-27 17:23:26,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31002 conditions, 6463 events. 3525/6463 cut-off events. For 63534/63534 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 41999 event pairs, 653 based on Foata normal form. 18/6443 useless extension candidates. Maximal degree in co-relation 30939. Up to 3759 conditions per place. [2024-06-27 17:23:26,135 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 213 selfloop transitions, 98 changer transitions 2/316 dead transitions. [2024-06-27 17:23:26,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 316 transitions, 4446 flow [2024-06-27 17:23:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:23:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:23:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 232 transitions. [2024-06-27 17:23:26,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3525835866261398 [2024-06-27 17:23:26,141 INFO L175 Difference]: Start difference. First operand has 168 places, 225 transitions, 3221 flow. Second operand 14 states and 232 transitions. [2024-06-27 17:23:26,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 316 transitions, 4446 flow [2024-06-27 17:23:26,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 316 transitions, 4245 flow, removed 62 selfloop flow, removed 8 redundant places. [2024-06-27 17:23:26,330 INFO L231 Difference]: Finished difference. Result has 177 places, 240 transitions, 3522 flow [2024-06-27 17:23:26,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3044, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3522, PETRI_PLACES=177, PETRI_TRANSITIONS=240} [2024-06-27 17:23:26,331 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places. [2024-06-27 17:23:26,331 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 240 transitions, 3522 flow [2024-06-27 17:23:26,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:23:26,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:23:26,331 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-06-27 17:23:26,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:23:26,532 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,SelfDestructingSolverStorable14 [2024-06-27 17:23:26,532 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:23:26,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:23:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 432989634, now seen corresponding path program 1 times [2024-06-27 17:23:26,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:23:26,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764215769] [2024-06-27 17:23:26,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:23:26,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:23:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:23:26,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:23:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:23:26,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:23:26,601 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:23:26,602 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 17:23:26,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 17:23:26,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-06-27 17:23:26,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-06-27 17:23:26,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-06-27 17:23:26,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-06-27 17:23:26,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 17:23:26,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 17:23:26,605 INFO L445 BasicCegarLoop]: Path program histogram: [5, 5, 1, 1, 1, 1, 1, 1] [2024-06-27 17:23:26,611 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:23:26,611 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:23:26,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:23:26 BasicIcfg [2024-06-27 17:23:26,683 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:23:26,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:23:26,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:23:26,683 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:23:26,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:22:08" (3/4) ... [2024-06-27 17:23:26,684 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:23:26,743 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:23:26,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:23:26,744 INFO L158 Benchmark]: Toolchain (without parser) took 79882.51ms. Allocated memory was 136.3MB in the beginning and 763.4MB in the end (delta: 627.0MB). Free memory was 79.6MB in the beginning and 425.2MB in the end (delta: -345.6MB). Peak memory consumption was 282.7MB. Max. memory is 16.1GB. [2024-06-27 17:23:26,744 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:23:26,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.77ms. Allocated memory is still 136.3MB. Free memory was 79.0MB in the beginning and 47.3MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-27 17:23:26,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.13ms. Allocated memory is still 136.3MB. Free memory was 47.3MB in the beginning and 44.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:23:26,744 INFO L158 Benchmark]: Boogie Preprocessor took 70.79ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 44.0MB in the beginning and 144.8MB in the end (delta: -100.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-06-27 17:23:26,745 INFO L158 Benchmark]: RCFGBuilder took 669.83ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 75.6MB in the end (delta: 69.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-06-27 17:23:26,745 INFO L158 Benchmark]: TraceAbstraction took 78456.10ms. Allocated memory was 176.2MB in the beginning and 763.4MB in the end (delta: 587.2MB). Free memory was 75.6MB in the beginning and 436.7MB in the end (delta: -361.1MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. [2024-06-27 17:23:26,745 INFO L158 Benchmark]: Witness Printer took 60.47ms. Allocated memory is still 763.4MB. Free memory was 436.7MB in the beginning and 425.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-06-27 17:23:26,745 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.14ms. Allocated memory is still 136.3MB. Free memory is still 72.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.77ms. Allocated memory is still 136.3MB. Free memory was 79.0MB in the beginning and 47.3MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.13ms. Allocated memory is still 136.3MB. Free memory was 47.3MB in the beginning and 44.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.79ms. Allocated memory was 136.3MB in the beginning and 176.2MB in the end (delta: 39.8MB). Free memory was 44.0MB in the beginning and 144.8MB in the end (delta: -100.9MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * RCFGBuilder took 669.83ms. Allocated memory is still 176.2MB. Free memory was 144.8MB in the beginning and 75.6MB in the end (delta: 69.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 78456.10ms. Allocated memory was 176.2MB in the beginning and 763.4MB in the end (delta: 587.2MB). Free memory was 75.6MB in the beginning and 436.7MB in the end (delta: -361.1MB). Peak memory consumption was 225.9MB. Max. memory is 16.1GB. * Witness Printer took 60.47ms. Allocated memory is still 763.4MB. Free memory was 436.7MB in the beginning and 425.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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[(400)]; [L949] 0 int stored_elements[(400)]; [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=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(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=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(400) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [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 [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(400) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, 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 == (400)) [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) [L1014] COND FALSE 1 !(empty(&queue)) [L1018] 1 i=0 VAL [\old(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=0] [L1018] COND TRUE 1 i<((400)-1) VAL [\old(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=0] [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 == (400)) [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 [\old(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=1] [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 == (400)) [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 [\old(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 [\old(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, 71 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: 78.3s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 35.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 1502 SdHoareTripleChecker+Valid, 29.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1455 mSDsluCounter, 993 SdHoareTripleChecker+Invalid, 28.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 969 mSDsCounter, 106 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8042 IncrementalHoareTripleChecker+Invalid, 8152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 106 mSolverCounterUnsat, 24 mSDtfsCounter, 8042 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 434 GetRequests, 199 SyntacticMatches, 12 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3522occurred in iteration=15, InterpolantAutomatonStates: 151, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 40.1s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 588 ConstructedInterpolants, 114 QuantifiedInterpolants, 84155 SizeOfPredicates, 189 NumberOfNonLiveVariables, 1270 ConjunctsInSsa, 230 ConjunctsInUnsatCore, 25 InterpolantComputations, 10 PerfectInterpolantSequences, 3/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-06-27 17:23:26,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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