./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/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.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:26:50,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:26:50,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:26:50,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:26:50,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:26:50,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:26:50,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:26:50,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:26:50,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:26:50,439 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:26:50,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:26:50,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:26:50,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:26:50,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:26:50,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:26:50,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:26:50,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:26:50,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:26:50,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:26:50,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:26:50,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:26:50,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:26:50,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:26:50,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:26:50,443 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:26:50,443 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:26:50,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:26:50,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:26:50,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:26:50,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:26:50,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:26:50,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:26:50,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:26:50,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:26:50,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:26:50,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:26:50,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:26:50,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:26:50,446 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:26:50,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:26:50,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:26:50,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:26:50,447 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-11-22 13:26:50,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:26:50,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:26:50,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:26:50,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:26:50,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:26:50,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2024-11-22 13:26:51,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:26:52,203 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:26:52,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2024-11-22 13:26:52,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9608f4f08/0bae6612f909429793771f0c3eb6e271/FLAGdf6796a97 [2024-11-22 13:26:52,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9608f4f08/0bae6612f909429793771f0c3eb6e271 [2024-11-22 13:26:52,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:26:52,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:26:52,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:26:52,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:26:52,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:26:52,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:26:52" (1/1) ... [2024-11-22 13:26:52,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ddb036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:52, skipping insertion in model container [2024-11-22 13:26:52,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:26:52" (1/1) ... [2024-11-22 13:26:52,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:26:52,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2024-11-22 13:26:52,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2024-11-22 13:26:52,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2024-11-22 13:26:52,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:26:52,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:26:53,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43296,43309] [2024-11-22 13:26:53,007 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43503,43516] [2024-11-22 13:26:53,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i[43783,43796] [2024-11-22 13:26:53,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:26:53,157 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:26:53,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53 WrapperNode [2024-11-22 13:26:53,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:26:53,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:26:53,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:26:53,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:26:53,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,254 INFO L138 Inliner]: procedures = 274, calls = 856, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 1040 [2024-11-22 13:26:53,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:26:53,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:26:53,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:26:53,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:26:53,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,307 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2024-11-22 13:26:53,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:26:53,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:26:53,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:26:53,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:26:53,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (1/1) ... [2024-11-22 13:26:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:26:53,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:26:53,393 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-11-22 13:26:53,396 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-11-22 13:26:53,431 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-22 13:26:53,432 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-22 13:26:53,432 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-22 13:26:53,432 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-22 13:26:53,432 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 13:26:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 13:26:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:26:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:26:53,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 13:26:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 13:26:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 13:26:53,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:26:53,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:26:53,437 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:26:53,550 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:26:53,552 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:26:54,546 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:26:54,547 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:26:59,876 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:26:59,876 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 13:26:59,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:59 BoogieIcfgContainer [2024-11-22 13:26:59,877 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:26:59,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:26:59,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:26:59,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:26:59,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:26:52" (1/3) ... [2024-11-22 13:26:59,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c10118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:26:59, skipping insertion in model container [2024-11-22 13:26:59,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:26:53" (2/3) ... [2024-11-22 13:26:59,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c10118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:26:59, skipping insertion in model container [2024-11-22 13:26:59,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:26:59" (3/3) ... [2024-11-22 13:26:59,883 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-11-22 13:26:59,905 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:26:59,905 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-22 13:26:59,905 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:26:59,969 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-22 13:27:00,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2024-11-22 13:27:00,059 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2024-11-22 13:27:00,060 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 13:27:00,063 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-11-22 13:27:00,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2024-11-22 13:27:00,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2024-11-22 13:27:00,078 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:27:00,084 INFO L333 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, 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;@7f07338, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:27:00,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 13:27:00,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:27:00,113 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-22 13:27:00,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 13:27:00,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:00,114 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 13:27:00,115 INFO L396 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-11-22 13:27:00,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:00,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2224825, now seen corresponding path program 1 times [2024-11-22 13:27:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:00,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799228397] [2024-11-22 13:27:00,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:00,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:00,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799228397] [2024-11-22 13:27:00,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799228397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:00,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:00,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:27:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475958625] [2024-11-22 13:27:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:00,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:27:00,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:27:00,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:27:00,527 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:00,528 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-11-22 13:27:00,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:00,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:00,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:00,843 INFO L124 PetriNetUnfolderBase]: 425/768 cut-off events. [2024-11-22 13:27:00,844 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-22 13:27:00,846 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-11-22 13:27:00,850 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-11-22 13:27:00,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2024-11-22 13:27:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:27:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-22 13:27:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-11-22 13:27:00,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-11-22 13:27:00,861 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2024-11-22 13:27:00,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2024-11-22 13:27:00,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:27:00,865 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2024-11-22 13:27:00,867 INFO L260 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-11-22 13:27:00,869 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-11-22 13:27:00,870 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2024-11-22 13:27:00,870 INFO L472 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-11-22 13:27:00,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:00,871 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:27:00,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:27:00,871 INFO L396 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-11-22 13:27:00,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1592744654, now seen corresponding path program 1 times [2024-11-22 13:27:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:00,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732693163] [2024-11-22 13:27:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:00,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:01,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:01,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732693163] [2024-11-22 13:27:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732693163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:01,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:27:01,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375038195] [2024-11-22 13:27:01,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:01,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:27:01,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:27:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:27:01,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:01,105 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-11-22 13:27:01,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:01,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:01,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:01,389 INFO L124 PetriNetUnfolderBase]: 405/748 cut-off events. [2024-11-22 13:27:01,390 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-22 13:27:01,393 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-11-22 13:27:01,398 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-11-22 13:27:01,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2024-11-22 13:27:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:27:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:27:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-22 13:27:01,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-11-22 13:27:01,399 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2024-11-22 13:27:01,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2024-11-22 13:27:01,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:27:01,401 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2024-11-22 13:27:01,401 INFO L260 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-11-22 13:27:01,402 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-11-22 13:27:01,402 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2024-11-22 13:27:01,403 INFO L472 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-11-22 13:27:01,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:01,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:27:01,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:27:01,404 INFO L396 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-11-22 13:27:01,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2130447266, now seen corresponding path program 1 times [2024-11-22 13:27:01,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:01,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276248007] [2024-11-22 13:27:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:02,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276248007] [2024-11-22 13:27:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276248007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:27:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171584012] [2024-11-22 13:27:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:02,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:27:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:27:02,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:27:02,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:02,720 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-11-22 13:27:02,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:02,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:02,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:03,198 INFO L124 PetriNetUnfolderBase]: 674/1239 cut-off events. [2024-11-22 13:27:03,199 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-22 13:27:03,201 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-11-22 13:27:03,206 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 71 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2024-11-22 13:27:03,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 371 flow [2024-11-22 13:27:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:27:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 13:27:03,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-11-22 13:27:03,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-11-22 13:27:03,210 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 146 transitions. [2024-11-22 13:27:03,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 371 flow [2024-11-22 13:27:03,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 13:27:03,214 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2024-11-22 13:27:03,215 INFO L260 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-11-22 13:27:03,216 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-11-22 13:27:03,216 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2024-11-22 13:27:03,216 INFO L472 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-11-22 13:27:03,217 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:03,217 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:27:03,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:27:03,218 INFO L396 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-11-22 13:27:03,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:03,218 INFO L85 PathProgramCache]: Analyzing trace with hash 147324961, now seen corresponding path program 1 times [2024-11-22 13:27:03,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:03,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958292227] [2024-11-22 13:27:03,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:03,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958292227] [2024-11-22 13:27:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958292227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:03,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:03,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:27:03,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023502114] [2024-11-22 13:27:03,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:03,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:27:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:27:03,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:27:03,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:03,473 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-11-22 13:27:03,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:03,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:03,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:03,768 INFO L124 PetriNetUnfolderBase]: 421/812 cut-off events. [2024-11-22 13:27:03,768 INFO L125 PetriNetUnfolderBase]: For 151/154 co-relation queries the response was YES. [2024-11-22 13:27:03,769 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-11-22 13:27:03,771 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 3/50 dead transitions. [2024-11-22 13:27:03,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 217 flow [2024-11-22 13:27:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:27:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:27:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-11-22 13:27:03,772 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-11-22 13:27:03,772 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 74 transitions. [2024-11-22 13:27:03,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 217 flow [2024-11-22 13:27:03,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:27:03,774 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2024-11-22 13:27:03,774 INFO L260 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-11-22 13:27:03,774 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-11-22 13:27:03,775 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2024-11-22 13:27:03,775 INFO L472 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-11-22 13:27:03,775 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:03,775 INFO L204 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-11-22 13:27:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:27:03,775 INFO L396 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-11-22 13:27:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1933850492, now seen corresponding path program 1 times [2024-11-22 13:27:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:03,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616826389] [2024-11-22 13:27:03,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:03,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:03,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:03,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616826389] [2024-11-22 13:27:03,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616826389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:03,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:03,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:27:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445609022] [2024-11-22 13:27:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:03,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:27:03,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:03,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:27:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:27:03,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:03,974 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-11-22 13:27:03,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:03,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:03,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:04,205 INFO L124 PetriNetUnfolderBase]: 249/544 cut-off events. [2024-11-22 13:27:04,205 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-22 13:27:04,206 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-11-22 13:27:04,208 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-11-22 13:27:04,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 211 flow [2024-11-22 13:27:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:27:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:27:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-11-22 13:27:04,209 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-11-22 13:27:04,209 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 71 transitions. [2024-11-22 13:27:04,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 211 flow [2024-11-22 13:27:04,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 201 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-22 13:27:04,212 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2024-11-22 13:27:04,212 INFO L260 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-11-22 13:27:04,212 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-11-22 13:27:04,213 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2024-11-22 13:27:04,213 INFO L472 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-11-22 13:27:04,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:04,213 INFO L204 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-11-22 13:27:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:27:04,213 INFO L396 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-11-22 13:27:04,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1438679454, now seen corresponding path program 1 times [2024-11-22 13:27:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:04,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094660797] [2024-11-22 13:27:04,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:07,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094660797] [2024-11-22 13:27:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094660797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:07,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:27:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43967746] [2024-11-22 13:27:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:07,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:27:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:07,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:27:07,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:27:07,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:07,324 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-11-22 13:27:07,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:07,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:07,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:07,854 INFO L124 PetriNetUnfolderBase]: 357/783 cut-off events. [2024-11-22 13:27:07,854 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2024-11-22 13:27:07,855 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-11-22 13:27:07,858 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 65 selfloop transitions, 14 changer transitions 8/93 dead transitions. [2024-11-22 13:27:07,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 455 flow [2024-11-22 13:27:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:27:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:27:07,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-11-22 13:27:07,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2024-11-22 13:27:07,860 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 9 states and 177 transitions. [2024-11-22 13:27:07,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 455 flow [2024-11-22 13:27:07,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:27:07,862 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 202 flow [2024-11-22 13:27:07,863 INFO L260 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-11-22 13:27:07,864 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-11-22 13:27:07,864 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 202 flow [2024-11-22 13:27:07,864 INFO L472 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-11-22 13:27:07,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:07,864 INFO L204 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-11-22 13:27:07,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:27:07,865 INFO L396 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-11-22 13:27:07,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2120449762, now seen corresponding path program 2 times [2024-11-22 13:27:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258593937] [2024-11-22 13:27:07,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:27:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:08,173 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 13:27:08,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258593937] [2024-11-22 13:27:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258593937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:27:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114352508] [2024-11-22 13:27:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:10,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:27:10,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:10,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:27:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:27:10,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:10,658 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-11-22 13:27:10,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:10,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:10,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:11,332 INFO L124 PetriNetUnfolderBase]: 466/1037 cut-off events. [2024-11-22 13:27:11,333 INFO L125 PetriNetUnfolderBase]: For 797/799 co-relation queries the response was YES. [2024-11-22 13:27:11,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2692 conditions, 1037 events. 466/1037 cut-off events. For 797/799 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5746 event pairs, 131 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 2679. Up to 607 conditions per place. [2024-11-22 13:27:11,338 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 69 selfloop transitions, 15 changer transitions 4/94 dead transitions. [2024-11-22 13:27:11,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 568 flow [2024-11-22 13:27:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:27:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:27:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-11-22 13:27:11,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3947990543735225 [2024-11-22 13:27:11,340 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 202 flow. Second operand 9 states and 167 transitions. [2024-11-22 13:27:11,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 568 flow [2024-11-22 13:27:11,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 550 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-22 13:27:11,345 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 347 flow [2024-11-22 13:27:11,345 INFO L260 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=347, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-11-22 13:27:11,346 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2024-11-22 13:27:11,346 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 347 flow [2024-11-22 13:27:11,346 INFO L472 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-11-22 13:27:11,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:11,346 INFO L204 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-11-22 13:27:11,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:27:11,347 INFO L396 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-11-22 13:27:11,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1800930064, now seen corresponding path program 3 times [2024-11-22 13:27:11,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406444710] [2024-11-22 13:27:11,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:27:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:11,600 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 13:27:11,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:13,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406444710] [2024-11-22 13:27:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406444710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:27:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395489105] [2024-11-22 13:27:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:13,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:27:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:13,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:27:13,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:27:13,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:13,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 347 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-11-22 13:27:13,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:13,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:13,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:14,520 INFO L124 PetriNetUnfolderBase]: 538/1159 cut-off events. [2024-11-22 13:27:14,521 INFO L125 PetriNetUnfolderBase]: For 1569/1570 co-relation queries the response was YES. [2024-11-22 13:27:14,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 1159 events. 538/1159 cut-off events. For 1569/1570 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6225 event pairs, 52 based on Foata normal form. 22/1166 useless extension candidates. Maximal degree in co-relation 3295. Up to 293 conditions per place. [2024-11-22 13:27:14,532 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 89 selfloop transitions, 32 changer transitions 2/129 dead transitions. [2024-11-22 13:27:14,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 129 transitions, 860 flow [2024-11-22 13:27:14,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 13:27:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-22 13:27:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 229 transitions. [2024-11-22 13:27:14,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40602836879432624 [2024-11-22 13:27:14,534 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 347 flow. Second operand 12 states and 229 transitions. [2024-11-22 13:27:14,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 129 transitions, 860 flow [2024-11-22 13:27:14,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 129 transitions, 812 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-11-22 13:27:14,546 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 480 flow [2024-11-22 13:27:14,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=480, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-11-22 13:27:14,547 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2024-11-22 13:27:14,547 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 480 flow [2024-11-22 13:27:14,548 INFO L472 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-11-22 13:27:14,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:14,548 INFO L204 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-11-22 13:27:14,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:27:14,549 INFO L396 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-11-22 13:27:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:14,550 INFO L85 PathProgramCache]: Analyzing trace with hash 623361774, now seen corresponding path program 4 times [2024-11-22 13:27:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:14,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042185873] [2024-11-22 13:27:14,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:27:14,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:14,648 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:27:14,648 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:16,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:16,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042185873] [2024-11-22 13:27:16,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042185873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:27:16,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:27:16,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:27:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924321987] [2024-11-22 13:27:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:27:16,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:27:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:16,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:27:16,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:27:16,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-11-22 13:27:16,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 480 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-11-22 13:27:16,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:16,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-11-22 13:27:16,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:17,250 INFO L124 PetriNetUnfolderBase]: 612/1332 cut-off events. [2024-11-22 13:27:17,250 INFO L125 PetriNetUnfolderBase]: For 3078/3078 co-relation queries the response was YES. [2024-11-22 13:27:17,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1332 events. 612/1332 cut-off events. For 3078/3078 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7405 event pairs, 133 based on Foata normal form. 0/1317 useless extension candidates. Maximal degree in co-relation 4241. Up to 652 conditions per place. [2024-11-22 13:27:17,259 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 88 selfloop transitions, 22 changer transitions 2/118 dead transitions. [2024-11-22 13:27:17,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 118 transitions, 940 flow [2024-11-22 13:27:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 13:27:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 13:27:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-11-22 13:27:17,261 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41134751773049644 [2024-11-22 13:27:17,261 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 480 flow. Second operand 9 states and 174 transitions. [2024-11-22 13:27:17,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 118 transitions, 940 flow [2024-11-22 13:27:17,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 118 transitions, 868 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-11-22 13:27:17,270 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 621 flow [2024-11-22 13:27:17,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=621, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2024-11-22 13:27:17,271 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 47 predicate places. [2024-11-22 13:27:17,271 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 621 flow [2024-11-22 13:27:17,272 INFO L472 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-11-22 13:27:17,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:17,272 INFO L204 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-11-22 13:27:17,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 13:27:17,272 INFO L396 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-11-22 13:27:17,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash 319539240, now seen corresponding path program 1 times [2024-11-22 13:27:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423225907] [2024-11-22 13:27:17,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:17,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:19,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423225907] [2024-11-22 13:27:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423225907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:27:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004193809] [2024-11-22 13:27:19,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:27:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:19,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:27:19,673 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-11-22 13:27:19,674 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-11-22 13:27:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:27:19,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 13:27:19,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:27:20,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2024-11-22 13:27:20,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:20,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 31 [2024-11-22 13:27:20,173 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-11-22 13:27:20,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:20,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 51 [2024-11-22 13:27:20,403 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 27 treesize of output 15 [2024-11-22 13:27:20,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:20,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 25 [2024-11-22 13:27:20,787 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 7 [2024-11-22 13:27:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:20,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:27:21,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:21,401 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-11-22 13:27:21,415 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:21,415 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-11-22 13:27:27,570 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:27:27,571 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-11-22 13:27:27,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:27,594 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-11-22 13:27:44,390 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse35 (select .cse15 .cse4))) (let ((.cse36 (+ (* .cse35 4) |c_~#queue~0.offset|))) (let ((.cse0 (store .cse15 .cse36 0)) (.cse7 (store .cse15 .cse36 1))) (let ((.cse11 (= (mod c_~enqueue_flag~0 256) 0)) (.cse25 (+ 1600 |c_~#queue~0.offset|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse33 (select .cse7 .cse4)) (.cse34 (select .cse0 .cse4))) (let ((.cse6 (not (= 400 .cse34))) (.cse9 (not (= 400 .cse33))) (.cse10 (select .cse15 .cse2)) (.cse1 (+ |c_~#queue~0.offset| 4)) (.cse17 (+ (* (select .cse15 .cse25) 4) |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| (* (select .cse0 .cse25) 4))) (.cse8 (+ (* (select .cse7 .cse25) 4) |c_~#queue~0.offset|)) (.cse12 (not .cse11)) (.cse18 (= 401 .cse35)) (.cse14 (= 402 .cse35))) (and (or (let ((.cse3 (+ .cse10 2))) (and (or (forall ((v_DerPreprocessor_14 Int)) (or (= (select (store (store (store .cse0 .cse1 v_DerPreprocessor_14) .cse2 .cse3) .cse4 2) .cse5) 0) (< (+ v_DerPreprocessor_14 2147483648) 0) (< 2147483647 v_DerPreprocessor_14))) .cse6) (or (forall ((v_DerPreprocessor_11 Int)) (not (= (select (store (store (store .cse7 .cse1 v_DerPreprocessor_11) .cse2 .cse3) .cse4 2) .cse8) 0))) .cse9))) .cse11) (or .cse12 (let ((.cse13 (+ .cse10 1))) (and (or .cse6 (= (select (store (store .cse0 .cse2 .cse13) .cse4 1) .cse5) 0)) (or .cse9 (not (= (select (store (store .cse7 .cse2 .cse13) .cse4 1) .cse8) 0)))))) (or (not .cse14) (and (or (let ((.cse16 (+ |c_~#queue~0.offset| 1612))) (and (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_21 Int)) (or (< (+ v_DerPreprocessor_14 2147483648) 0) (= (select (store (store (store .cse15 .cse16 v_DerPreprocessor_14) .cse2 (+ v_DerPreprocessor_21 1)) .cse4 404) .cse17) 0) (< 2147483647 v_DerPreprocessor_14))) (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_21 Int)) (or (< 2147483647 v_DerPreprocessor_11) (not (= (select (store (store (store .cse15 .cse16 v_DerPreprocessor_11) .cse2 (+ v_DerPreprocessor_21 1)) .cse4 404) .cse17) 0)) (< (+ v_DerPreprocessor_11 2147483648) 0))))) .cse11) (or (and (forall ((v_DerPreprocessor_21 Int)) (= 0 (select (store (store .cse15 .cse2 v_DerPreprocessor_21) .cse4 403) .cse17))) (forall ((v_DerPreprocessor_21 Int)) (not (= 0 (select (store (store .cse15 .cse2 v_DerPreprocessor_21) .cse4 403) .cse17))))) .cse12))) (or (not .cse18) (and (or .cse12 (and (forall ((v_DerPreprocessor_19 Int)) (= (select (store (store .cse15 .cse2 v_DerPreprocessor_19) .cse4 1) .cse17) 0)) (forall ((v_DerPreprocessor_19 Int)) (not (= (select (store (store .cse15 .cse2 v_DerPreprocessor_19) .cse4 2) .cse17) 0))))) (or (and (forall ((v_DerPreprocessor_11 Int) (v_DerPreprocessor_19 Int)) (or (not (= (select (store (store (store .cse15 (+ |c_~#queue~0.offset| 8) v_DerPreprocessor_11) .cse2 (+ v_DerPreprocessor_19 1)) .cse4 3) .cse17) 0)) (< 2147483647 v_DerPreprocessor_11) (< (+ v_DerPreprocessor_11 2147483648) 0))) (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_19 Int)) (or (< (+ v_DerPreprocessor_14 2147483648) 0) (= (select (store (store (store .cse15 .cse1 v_DerPreprocessor_14) .cse2 (+ v_DerPreprocessor_19 1)) .cse4 2) .cse17) 0) (< 2147483647 v_DerPreprocessor_14)))) .cse11))) (or (let ((.cse19 (+ .cse34 1)) (.cse20 (= 400 .cse35)) (.cse21 (+ .cse33 1))) (and (or (and (or (forall ((v_DerPreprocessor_23 Int)) (= (select (store (store .cse0 .cse2 v_DerPreprocessor_23) .cse4 .cse19) .cse5) 0)) .cse20) (or .cse20 (forall ((v_DerPreprocessor_23 Int)) (not (= (select (store (store .cse7 .cse2 v_DerPreprocessor_23) .cse4 .cse21) .cse8) 0))))) .cse12) (or .cse11 (let ((.cse23 (+ (* .cse34 4) |c_~#queue~0.offset| 4)) (.cse32 (+ (* 4 .cse33) |c_~#queue~0.offset| 4))) (and (or (forall ((v_DerPreprocessor_14 Int) (v_DerPreprocessor_23 Int) (v_DerPreprocessor_15 Int) (v_DerPreprocessor_16 Int) (v_prenex_54 Int)) (let ((.cse24 (store (store (store .cse0 .cse23 v_DerPreprocessor_14) .cse2 v_DerPreprocessor_15) .cse4 v_DerPreprocessor_16))) (let ((.cse22 (store (store .cse0 .cse2 v_DerPreprocessor_23) .cse4 .cse19)) (.cse27 (select .cse24 .cse23))) (let ((.cse26 (store .cse22 .cse23 .cse27))) (or (= 400 (select (store .cse22 .cse23 v_prenex_54) .cse4)) (= (select .cse24 (+ (* (select (store .cse22 .cse23 v_DerPreprocessor_14) .cse25) 4) |c_~#queue~0.offset|)) 0) (not (= v_DerPreprocessor_16 (+ (select .cse26 .cse4) 1))) (< 2147483647 .cse27) (< (+ .cse27 2147483648) 0) (not (= v_DerPreprocessor_15 (+ (select .cse26 .cse2) 1)))))))) .cse20) (or (forall ((v_DerPreprocessor_23 Int) (v_ArrVal_340 Int)) (not (= 400 (select (store (store (store .cse0 .cse2 v_DerPreprocessor_23) .cse4 .cse19) .cse23 v_ArrVal_340) .cse4)))) .cse20) (or (forall ((v_DerPreprocessor_13 Int) (v_DerPreprocessor_11 Int) (v_DerPreprocessor_12 Int) (v_DerPreprocessor_23 Int) (v_prenex_54 Int)) (let ((.cse30 (store (store (store .cse7 .cse32 v_DerPreprocessor_11) .cse2 v_DerPreprocessor_12) .cse4 v_DerPreprocessor_13))) (let ((.cse31 (store (store .cse7 .cse2 v_DerPreprocessor_23) .cse4 .cse21)) (.cse29 (select .cse30 .cse32))) (let ((.cse28 (store .cse31 .cse32 .cse29))) (or (not (= (+ (select .cse28 .cse2) 1) v_DerPreprocessor_12)) (< (+ .cse29 2147483648) 0) (< 2147483647 .cse29) (not (= (select .cse30 (+ (* (select (store .cse31 .cse32 v_DerPreprocessor_11) .cse25) 4) |c_~#queue~0.offset|)) 0)) (not (= v_DerPreprocessor_13 (+ (select .cse28 .cse4) 1))) (= 400 (select (store .cse31 .cse32 v_prenex_54) .cse4))))))) .cse20) (or .cse20 (forall ((v_DerPreprocessor_23 Int) (v_ArrVal_340 Int)) (not (= (select (store (store (store .cse7 .cse2 v_DerPreprocessor_23) .cse4 .cse21) .cse32 v_ArrVal_340) .cse4) 400))))))))) .cse18 .cse14)))))))) is different from false [2024-11-22 13:27:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:46,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004193809] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:27:46,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:27:46,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-22 13:27:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365806987] [2024-11-22 13:27:46,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:27:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 13:27:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:27:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 13:27:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=510, Unknown=4, NotChecked=48, Total=702 [2024-11-22 13:27:46,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-11-22 13:27:46,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 621 flow. Second operand has 27 states, 27 states have (on average 9.666666666666666) internal successors, (261), 27 states have internal predecessors, (261), 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-11-22 13:27:46,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:27:46,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-11-22 13:27:46,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:27:51,201 INFO L124 PetriNetUnfolderBase]: 1517/2804 cut-off events. [2024-11-22 13:27:51,201 INFO L125 PetriNetUnfolderBase]: For 6798/6798 co-relation queries the response was YES. [2024-11-22 13:27:51,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9092 conditions, 2804 events. 1517/2804 cut-off events. For 6798/6798 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15168 event pairs, 144 based on Foata normal form. 31/2826 useless extension candidates. Maximal degree in co-relation 9061. Up to 996 conditions per place. [2024-11-22 13:27:51,225 INFO L140 encePairwiseOnDemand]: 32/47 looper letters, 152 selfloop transitions, 70 changer transitions 6/231 dead transitions. [2024-11-22 13:27:51,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 231 transitions, 1812 flow [2024-11-22 13:27:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 13:27:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-22 13:27:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 316 transitions. [2024-11-22 13:27:51,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3538633818589026 [2024-11-22 13:27:51,228 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 621 flow. Second operand 19 states and 316 transitions. [2024-11-22 13:27:51,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 231 transitions, 1812 flow [2024-11-22 13:27:51,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 231 transitions, 1704 flow, removed 50 selfloop flow, removed 2 redundant places. [2024-11-22 13:27:51,249 INFO L231 Difference]: Finished difference. Result has 117 places, 126 transitions, 1180 flow [2024-11-22 13:27:51,250 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1180, PETRI_PLACES=117, PETRI_TRANSITIONS=126} [2024-11-22 13:27:51,250 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places. [2024-11-22 13:27:51,250 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 126 transitions, 1180 flow [2024-11-22 13:27:51,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.666666666666666) internal successors, (261), 27 states have internal predecessors, (261), 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-11-22 13:27:51,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:27:51,251 INFO L204 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-11-22 13:27:51,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 13:27:51,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 13:27:51,453 INFO L396 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-11-22 13:27:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:27:51,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1271437340, now seen corresponding path program 2 times [2024-11-22 13:27:51,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:27:51,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692750138] [2024-11-22 13:27:51,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:27:51,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:27:51,663 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:27:51,663 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:27:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692750138] [2024-11-22 13:27:54,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692750138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:27:54,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256623138] [2024-11-22 13:27:54,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:27:54,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:27:54,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:27:54,401 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-11-22 13:27:54,402 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-11-22 13:27:55,319 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:27:55,320 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:27:55,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 13:27:55,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:27:55,339 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 23 treesize of output 28 [2024-11-22 13:27:55,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:55,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 35 [2024-11-22 13:27:55,463 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-11-22 13:27:55,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:27:55,693 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 35 treesize of output 15 [2024-11-22 13:27:55,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:55,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 59 [2024-11-22 13:27:56,290 INFO L349 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2024-11-22 13:27:56,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 51 [2024-11-22 13:27:56,293 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 45 treesize of output 33 [2024-11-22 13:27:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:27:56,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:27:56,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:27:56,735 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 53 treesize of output 51 [2024-11-22 13:28:06,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:28:06,920 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-11-22 13:28:06,942 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:28:06,944 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-11-22 13:28:11,842 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse13 (+ |c_~#queue~0.offset| 1604))) (let ((.cse25 (select .cse4 .cse13)) (.cse17 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse16 (+ 1600 |c_~#queue~0.offset|)) (.cse18 (+ (select .cse4 .cse17) 1)) (.cse10 (= 402 .cse25)) (.cse12 (+ (* .cse25 4) |c_~#queue~0.offset|))) (let ((.cse6 (select |c_#memory_int#2| |c_~#stored_elements~0.base|)) (.cse7 (+ (* |c_t2Thread1of1ForFork0_~i~1#1| 4) |c_~#stored_elements~0.offset|)) (.cse9 (forall ((v_ArrVal_454 Int)) (= 400 (select (store .cse4 .cse12 v_ArrVal_454) .cse13)))) (.cse21 (not .cse10)) (.cse19 (not (= 401 .cse25))) (.cse20 (store .cse4 .cse17 .cse18)) (.cse5 (+ (* (select .cse4 .cse16) 4) |c_~#queue~0.offset|)) (.cse8 (forall ((v_ArrVal_454 Int)) (not (= 400 (select (store .cse4 .cse12 v_ArrVal_454) .cse13)))))) (and (let ((.cse2 (select .cse6 .cse7))) (let ((.cse3 (= .cse2 0))) (let ((.cse0 (not .cse3)) (.cse1 (= (select .cse4 .cse5) 0))) (or (and .cse0 (not .cse1)) (and .cse0 (not (= .cse2 1))) (and .cse1 .cse3))))) (or (and .cse8 (or .cse9 (and (or .cse10 (forall ((v_DerPreprocessor_33 Int) (v_DerPreprocessor_34 Int)) (let ((.cse15 (store .cse4 .cse12 v_DerPreprocessor_33))) (let ((.cse14 (store (store .cse15 .cse17 .cse18) .cse13 v_DerPreprocessor_34))) (let ((.cse11 (select .cse14 .cse12))) (or (< (+ .cse11 2147483648) 0) (< 2147483647 .cse11) (not (= (+ (select (store .cse4 .cse12 .cse11) .cse13) 1) v_DerPreprocessor_34)) (= (select .cse14 (+ |c_~#queue~0.offset| (* (select .cse15 .cse16) 4))) 0))))))) (or .cse19 (forall ((v_DerPreprocessor_35 Int)) (or (< (+ 2147483647 v_DerPreprocessor_35) 0) (= (select (store .cse20 .cse13 v_DerPreprocessor_35) .cse5) 0) (< 2147483648 v_DerPreprocessor_35)))) (or .cse21 (forall ((v_DerPreprocessor_32 Int)) (or (< 2147483648 v_DerPreprocessor_32) (= (select (store (store .cse4 .cse17 v_DerPreprocessor_32) .cse13 403) .cse5) 0) (< (+ 2147483647 v_DerPreprocessor_32) 0))))))) (forall ((|v_t1Thread1of1ForFork1_~i~0#1_24| Int) (v_DerPreprocessor_31 Int)) (or (< |v_t1Thread1of1ForFork1_~i~0#1_24| 0) (not (= 0 (select (store .cse6 (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork1_~i~0#1_24| 4)) v_DerPreprocessor_31) .cse7)))))) (or (forall ((|v_t1Thread1of1ForFork1_~i~0#1_24| Int) (v_DerPreprocessor_31 Int)) (or (< |v_t1Thread1of1ForFork1_~i~0#1_24| 0) (not (= 1 (select (store .cse6 (+ |c_~#stored_elements~0.offset| 4 (* |v_t1Thread1of1ForFork1_~i~0#1_24| 4)) v_DerPreprocessor_31) .cse7))))) (and (or .cse9 (and (or .cse21 (forall ((v_DerPreprocessor_39 Int)) (or (< 2147483648 v_DerPreprocessor_39) (not (= (select (store (store .cse4 .cse17 v_DerPreprocessor_39) .cse13 403) .cse5) 0)) (< (+ 2147483647 v_DerPreprocessor_39) 0)))) (or (forall ((v_DerPreprocessor_40 Int) (v_DerPreprocessor_41 Int)) (let ((.cse24 (store .cse4 .cse12 v_DerPreprocessor_40))) (let ((.cse23 (store (store .cse24 .cse17 .cse18) .cse13 v_DerPreprocessor_41))) (let ((.cse22 (select .cse23 .cse12))) (or (< 2147483647 .cse22) (not (= 0 (select .cse23 (+ |c_~#queue~0.offset| (* (select .cse24 .cse16) 4))))) (not (= v_DerPreprocessor_41 (+ (select (store .cse4 .cse12 .cse22) .cse13) 1))) (< (+ .cse22 2147483648) 0)))))) .cse10) (or .cse19 (forall ((v_DerPreprocessor_38 Int)) (or (< 2147483648 v_DerPreprocessor_38) (< (+ 2147483647 v_DerPreprocessor_38) 0) (not (= 0 (select (store .cse20 .cse13 v_DerPreprocessor_38) .cse5)))))))) .cse8))))))) is different from false [2024-11-22 13:28:12,258 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-11-22 13:28:12,262 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-11-22 13:28:12,314 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-11-22 13:28:12,317 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-11-22 13:28:12,326 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 98 treesize of output 90 [2024-11-22 13:28:12,331 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 130 treesize of output 106 [2024-11-22 13:28:12,787 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-22 13:28:12,788 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-11-22 13:28:12,922 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-22 13:28:12,926 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-22 13:28:13,016 WARN L214 Elim1Store]: Array PQE input equivalent to true