./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:08:54,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:08:54,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:08:54,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:08:54,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:08:54,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:08:54,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:08:54,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:08:54,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:08:54,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:08:54,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:08:54,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:08:54,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:08:54,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:08:54,096 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:08:54,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:08:54,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:08:54,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:08:54,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:08:54,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:08:54,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:08:54,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:08:54,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:08:54,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:08:54,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:08:54,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:08:54,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:08:54,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:08:54,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:08:54,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:08:54,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:08:54,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:08:54,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:08:54,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:08:54,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:08:54,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:08:54,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:08:54,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:08:54,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:08:54,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:08:54,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:08:54,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:08:54,108 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2024-10-11 14:08:54,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:08:54,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:08:54,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:08:54,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:08:54,389 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:08:54,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2024-10-11 14:08:55,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:08:56,203 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:08:56,206 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2024-10-11 14:08:56,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e3923bfa/36fe66e640284f2eaa2a47ebf17249fb/FLAG0421ea6eb [2024-10-11 14:08:56,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e3923bfa/36fe66e640284f2eaa2a47ebf17249fb [2024-10-11 14:08:56,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:08:56,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:08:56,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:08:56,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:08:56,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:08:56,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@255604dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56, skipping insertion in model container [2024-10-11 14:08:56,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:08:56,756 WARN L248 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_longest.i[43296,43309] [2024-10-11 14:08:56,762 WARN L248 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_longest.i[43503,43516] [2024-10-11 14:08:56,764 WARN L248 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_longest.i[43783,43796] [2024-10-11 14:08:56,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:08:56,778 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:08:56,838 WARN L248 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_longest.i[43296,43309] [2024-10-11 14:08:56,839 WARN L248 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_longest.i[43503,43516] [2024-10-11 14:08:56,841 WARN L248 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_longest.i[43783,43796] [2024-10-11 14:08:56,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:08:56,892 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:08:56,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56 WrapperNode [2024-10-11 14:08:56,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:08:56,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:08:56,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:08:56,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:08:56,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,954 INFO L138 Inliner]: procedures = 274, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-10-11 14:08:56,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:08:56,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:08:56,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:08:56,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:08:56,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,983 INFO L175 MemorySlicer]: Split 43 memory accesses to 4 slices as follows [2, 32, 5, 4]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 18 writes are split as follows [0, 15, 0, 3]. [2024-10-11 14:08:56,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:56,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:57,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:57,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:57,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:57,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:08:57,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:08:57,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:08:57,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:08:57,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (1/1) ... [2024-10-11 14:08:57,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:08:57,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:08:57,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:08:57,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:08:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 14:08:57,084 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 14:08:57,084 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 14:08:57,085 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:08:57,085 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 14:08:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:08:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:08:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:08:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:08:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:08:57,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:08:57,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:08:57,088 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:08:57,223 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:08:57,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:08:57,595 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:08:57,596 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:08:57,930 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:08:57,932 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 14:08:57,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:08:57 BoogieIcfgContainer [2024-10-11 14:08:57,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:08:57,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:08:57,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:08:57,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:08:57,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:08:56" (1/3) ... [2024-10-11 14:08:57,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e4c970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:08:57, skipping insertion in model container [2024-10-11 14:08:57,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:08:56" (2/3) ... [2024-10-11 14:08:57,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13e4c970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:08:57, skipping insertion in model container [2024-10-11 14:08:57,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:08:57" (3/3) ... [2024-10-11 14:08:57,941 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-10-11 14:08:57,959 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:08:57,959 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 14:08:57,959 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:08:58,026 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 14:08:58,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 47 transitions, 108 flow [2024-10-11 14:08:58,094 INFO L124 PetriNetUnfolderBase]: 7/45 cut-off events. [2024-10-11 14:08:58,094 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:08:58,098 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-10-11 14:08:58,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 47 transitions, 108 flow [2024-10-11 14:08:58,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 43 transitions, 95 flow [2024-10-11 14:08:58,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:08:58,120 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;@392700d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:08:58,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 14:08:58,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:08:58,123 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-10-11 14:08:58,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:08:58,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:58,128 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 14:08:58,128 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-10-11 14:08:58,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:58,133 INFO L85 PathProgramCache]: Analyzing trace with hash 634039, now seen corresponding path program 1 times [2024-10-11 14:08:58,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:58,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888989984] [2024-10-11 14:08:58,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:58,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:58,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:58,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888989984] [2024-10-11 14:08:58,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888989984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:08:58,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518701723] [2024-10-11 14:08:58,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:58,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:08:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:08:58,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:08:58,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:08:58,410 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-10-11 14:08:58,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:58,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:08:58,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:58,665 INFO L124 PetriNetUnfolderBase]: 425/768 cut-off events. [2024-10-11 14:08:58,666 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-10-11 14:08:58,669 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-10-11 14:08:58,676 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-10-11 14:08:58,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 147 flow [2024-10-11 14:08:58,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:08:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 14:08:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2024-10-11 14:08:58,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2024-10-11 14:08:58,691 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 95 flow. Second operand 2 states and 54 transitions. [2024-10-11 14:08:58,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 147 flow [2024-10-11 14:08:58,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:08:58,697 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 80 flow [2024-10-11 14:08:58,699 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-10-11 14:08:58,704 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2024-10-11 14:08:58,704 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 80 flow [2024-10-11 14:08:58,705 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-10-11 14:08:58,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:58,705 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:08:58,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:08:58,706 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-10-11 14:08:58,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1778644364, now seen corresponding path program 1 times [2024-10-11 14:08:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:58,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791329688] [2024-10-11 14:08:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791329688] [2024-10-11 14:08:58,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791329688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:58,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:58,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:08:58,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445176150] [2024-10-11 14:08:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:58,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:08:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:58,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:08:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:08:58,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:08:58,931 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-10-11 14:08:58,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:58,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:08:58,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:59,141 INFO L124 PetriNetUnfolderBase]: 405/748 cut-off events. [2024-10-11 14:08:59,142 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 14:08:59,145 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-10-11 14:08:59,150 INFO L140 encePairwiseOnDemand]: 44/47 looper letters, 40 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2024-10-11 14:08:59,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 188 flow [2024-10-11 14:08:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:08:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:08:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-10-11 14:08:59,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-10-11 14:08:59,153 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 80 flow. Second operand 3 states and 73 transitions. [2024-10-11 14:08:59,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 188 flow [2024-10-11 14:08:59,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 14:08:59,156 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 82 flow [2024-10-11 14:08:59,157 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-10-11 14:08:59,158 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-10-11 14:08:59,158 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 82 flow [2024-10-11 14:08:59,158 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-10-11 14:08:59,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:08:59,159 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:08:59,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:08:59,160 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-10-11 14:08:59,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:08:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash -696597918, now seen corresponding path program 1 times [2024-10-11 14:08:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:08:59,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175474466] [2024-10-11 14:08:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:08:59,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:08:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:08:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:08:59,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:08:59,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175474466] [2024-10-11 14:08:59,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175474466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:08:59,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:08:59,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:08:59,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122896008] [2024-10-11 14:08:59,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:08:59,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:08:59,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:08:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:08:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:08:59,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:08:59,661 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-10-11 14:08:59,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:08:59,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:08:59,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:08:59,996 INFO L124 PetriNetUnfolderBase]: 674/1239 cut-off events. [2024-10-11 14:08:59,996 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-11 14:08:59,998 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-10-11 14:09:00,004 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 71 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2024-10-11 14:09:00,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 91 transitions, 371 flow [2024-10-11 14:09:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:09:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:09:00,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-10-11 14:09:00,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177304964539007 [2024-10-11 14:09:00,009 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 82 flow. Second operand 6 states and 146 transitions. [2024-10-11 14:09:00,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 91 transitions, 371 flow [2024-10-11 14:09:00,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 91 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:09:00,013 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 146 flow [2024-10-11 14:09:00,013 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-10-11 14:09:00,014 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2024-10-11 14:09:00,014 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 146 flow [2024-10-11 14:09:00,015 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-10-11 14:09:00,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:00,015 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:00,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:09:00,016 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-10-11 14:09:00,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash -343635105, now seen corresponding path program 1 times [2024-10-11 14:09:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:00,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775949072] [2024-10-11 14:09:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:00,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775949072] [2024-10-11 14:09:00,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775949072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:00,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:00,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:09:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212314408] [2024-10-11 14:09:00,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:00,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:09:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:09:00,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:09:00,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:09:00,113 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-10-11 14:09:00,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:00,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:09:00,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:00,250 INFO L124 PetriNetUnfolderBase]: 421/812 cut-off events. [2024-10-11 14:09:00,250 INFO L125 PetriNetUnfolderBase]: For 151/154 co-relation queries the response was YES. [2024-10-11 14:09:00,251 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-10-11 14:09:00,254 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 37 selfloop transitions, 4 changer transitions 3/50 dead transitions. [2024-10-11 14:09:00,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 217 flow [2024-10-11 14:09:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:09:00,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:09:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-11 14:09:00,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2024-10-11 14:09:00,256 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 146 flow. Second operand 3 states and 74 transitions. [2024-10-11 14:09:00,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 217 flow [2024-10-11 14:09:00,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 211 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:09:00,258 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 108 flow [2024-10-11 14:09:00,258 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-10-11 14:09:00,259 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2024-10-11 14:09:00,259 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 108 flow [2024-10-11 14:09:00,259 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-10-11 14:09:00,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:00,260 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-10-11 14:09:00,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:09:00,260 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-10-11 14:09:00,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:00,261 INFO L85 PathProgramCache]: Analyzing trace with hash -932670206, now seen corresponding path program 1 times [2024-10-11 14:09:00,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:00,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138275898] [2024-10-11 14:09:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:00,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:00,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:00,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138275898] [2024-10-11 14:09:00,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138275898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:00,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:09:00,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942836184] [2024-10-11 14:09:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:09:00,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:00,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:09:00,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:09:00,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:09:00,374 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-10-11 14:09:00,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:00,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:09:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:00,521 INFO L124 PetriNetUnfolderBase]: 249/544 cut-off events. [2024-10-11 14:09:00,521 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-11 14:09:00,524 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-10-11 14:09:00,526 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 34 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2024-10-11 14:09:00,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 211 flow [2024-10-11 14:09:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:09:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:09:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-10-11 14:09:00,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2024-10-11 14:09:00,529 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 108 flow. Second operand 3 states and 71 transitions. [2024-10-11 14:09:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 211 flow [2024-10-11 14:09:00,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 201 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-11 14:09:00,535 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 110 flow [2024-10-11 14:09:00,535 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-10-11 14:09:00,536 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-10-11 14:09:00,537 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 110 flow [2024-10-11 14:09:00,537 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-10-11 14:09:00,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:00,538 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-10-11 14:09:00,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:09:00,538 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-10-11 14:09:00,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1884471650, now seen corresponding path program 1 times [2024-10-11 14:09:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517013503] [2024-10-11 14:09:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517013503] [2024-10-11 14:09:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517013503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:01,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:09:01,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36888113] [2024-10-11 14:09:01,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:01,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:09:01,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:09:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:09:01,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:09:01,932 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-10-11 14:09:01,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:01,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:09:01,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:02,286 INFO L124 PetriNetUnfolderBase]: 357/783 cut-off events. [2024-10-11 14:09:02,287 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2024-10-11 14:09:02,288 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-10-11 14:09:02,291 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 65 selfloop transitions, 14 changer transitions 8/93 dead transitions. [2024-10-11 14:09:02,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 455 flow [2024-10-11 14:09:02,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:09:02,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:09:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-10-11 14:09:02,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41843971631205673 [2024-10-11 14:09:02,293 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 110 flow. Second operand 9 states and 177 transitions. [2024-10-11 14:09:02,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 455 flow [2024-10-11 14:09:02,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:09:02,296 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 202 flow [2024-10-11 14:09:02,296 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-10-11 14:09:02,297 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2024-10-11 14:09:02,297 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 202 flow [2024-10-11 14:09:02,297 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-10-11 14:09:02,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:02,298 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-10-11 14:09:02,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:09:02,298 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-10-11 14:09:02,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1148633570, now seen corresponding path program 2 times [2024-10-11 14:09:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860870551] [2024-10-11 14:09:02,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860870551] [2024-10-11 14:09:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860870551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:03,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:03,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:09:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052587814] [2024-10-11 14:09:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:03,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:09:03,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:09:03,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:09:03,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:09:03,361 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-10-11 14:09:03,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:03,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:09:03,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:03,731 INFO L124 PetriNetUnfolderBase]: 505/1132 cut-off events. [2024-10-11 14:09:03,732 INFO L125 PetriNetUnfolderBase]: For 896/898 co-relation queries the response was YES. [2024-10-11 14:09:03,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 1132 events. 505/1132 cut-off events. For 896/898 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6395 event pairs, 126 based on Foata normal form. 6/1118 useless extension candidates. Maximal degree in co-relation 2951. Up to 597 conditions per place. [2024-10-11 14:09:03,738 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 72 selfloop transitions, 21 changer transitions 2/101 dead transitions. [2024-10-11 14:09:03,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 618 flow [2024-10-11 14:09:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:09:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:09:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-10-11 14:09:03,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.408983451536643 [2024-10-11 14:09:03,740 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 202 flow. Second operand 9 states and 173 transitions. [2024-10-11 14:09:03,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 618 flow [2024-10-11 14:09:03,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 598 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-10-11 14:09:03,745 INFO L231 Difference]: Finished difference. Result has 64 places, 65 transitions, 396 flow [2024-10-11 14:09:03,745 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=396, PETRI_PLACES=64, PETRI_TRANSITIONS=65} [2024-10-11 14:09:03,746 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2024-10-11 14:09:03,746 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 65 transitions, 396 flow [2024-10-11 14:09:03,746 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-10-11 14:09:03,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:03,746 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-10-11 14:09:03,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:09:03,747 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-10-11 14:09:03,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1522221040, now seen corresponding path program 3 times [2024-10-11 14:09:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:03,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415760597] [2024-10-11 14:09:03,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:03,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415760597] [2024-10-11 14:09:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415760597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:09:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271180822] [2024-10-11 14:09:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:09:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:09:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:09:05,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:09:05,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 65 transitions, 396 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-10-11 14:09:05,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:05,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:09:05,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:05,736 INFO L124 PetriNetUnfolderBase]: 577/1252 cut-off events. [2024-10-11 14:09:05,736 INFO L125 PetriNetUnfolderBase]: For 1880/1881 co-relation queries the response was YES. [2024-10-11 14:09:05,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 1252 events. 577/1252 cut-off events. For 1880/1881 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6876 event pairs, 54 based on Foata normal form. 22/1259 useless extension candidates. Maximal degree in co-relation 3698. Up to 322 conditions per place. [2024-10-11 14:09:05,746 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 94 selfloop transitions, 34 changer transitions 2/136 dead transitions. [2024-10-11 14:09:05,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 136 transitions, 967 flow [2024-10-11 14:09:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:09:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 14:09:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 229 transitions. [2024-10-11 14:09:05,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40602836879432624 [2024-10-11 14:09:05,748 INFO L175 Difference]: Start difference. First operand has 64 places, 65 transitions, 396 flow. Second operand 12 states and 229 transitions. [2024-10-11 14:09:05,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 136 transitions, 967 flow [2024-10-11 14:09:05,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 136 transitions, 907 flow, removed 30 selfloop flow, removed 0 redundant places. [2024-10-11 14:09:05,762 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 539 flow [2024-10-11 14:09:05,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=539, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2024-10-11 14:09:05,764 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places. [2024-10-11 14:09:05,764 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 539 flow [2024-10-11 14:09:05,764 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-10-11 14:09:05,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:05,764 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-10-11 14:09:05,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:09:05,765 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-10-11 14:09:05,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1075971134, now seen corresponding path program 4 times [2024-10-11 14:09:05,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:05,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690290758] [2024-10-11 14:09:05,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:05,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:06,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690290758] [2024-10-11 14:09:06,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690290758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:06,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:06,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:09:06,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460395929] [2024-10-11 14:09:06,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:06,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:09:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:09:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:09:06,794 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 47 [2024-10-11 14:09:06,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 539 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-10-11 14:09:06,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:06,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 47 [2024-10-11 14:09:06,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:07,219 INFO L124 PetriNetUnfolderBase]: 651/1434 cut-off events. [2024-10-11 14:09:07,219 INFO L125 PetriNetUnfolderBase]: For 3518/3518 co-relation queries the response was YES. [2024-10-11 14:09:07,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4681 conditions, 1434 events. 651/1434 cut-off events. For 3518/3518 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8143 event pairs, 134 based on Foata normal form. 0/1419 useless extension candidates. Maximal degree in co-relation 4658. Up to 652 conditions per place. [2024-10-11 14:09:07,229 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 90 selfloop transitions, 27 changer transitions 2/125 dead transitions. [2024-10-11 14:09:07,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 1035 flow [2024-10-11 14:09:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:09:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:09:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-10-11 14:09:07,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41134751773049644 [2024-10-11 14:09:07,231 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 539 flow. Second operand 9 states and 174 transitions. [2024-10-11 14:09:07,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 1035 flow [2024-10-11 14:09:07,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 125 transitions, 951 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-10-11 14:09:07,245 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 697 flow [2024-10-11 14:09:07,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=697, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2024-10-11 14:09:07,247 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2024-10-11 14:09:07,247 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 697 flow [2024-10-11 14:09:07,247 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-10-11 14:09:07,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:07,250 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-10-11 14:09:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:09:07,251 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-10-11 14:09:07,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1433245030, now seen corresponding path program 1 times [2024-10-11 14:09:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330249936] [2024-10-11 14:09:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330249936] [2024-10-11 14:09:08,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330249936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:08,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076581882] [2024-10-11 14:09:08,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:08,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:08,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:08,521 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:08,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:09:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:08,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 14:09:08,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:08,751 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 7 treesize of output 6 [2024-10-11 14:09:08,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 14:09:08,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-10-11 14:09:08,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 14:09:08,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 14:09:09,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2024-10-11 14:09:09,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2024-10-11 14:09:09,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 97 treesize of output 85 [2024-10-11 14:09:09,792 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 73 treesize of output 61 [2024-10-11 14:09:09,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:09,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:10,520 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:10,520 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-10-11 14:09:10,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:10,584 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-10-11 14:09:21,227 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:21,228 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-10-11 14:09:21,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:21,244 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-10-11 14:09:23,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:23,289 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-10-11 14:09:23,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:23,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 3116 treesize of output 1807 [2024-10-11 14:09:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076581882] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:25,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-10-11 14:09:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050032055] [2024-10-11 14:09:25,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:25,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 14:09:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:25,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 14:09:25,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=605, Unknown=2, NotChecked=0, Total=756 [2024-10-11 14:09:29,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 14:09:33,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 14:09:33,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-10-11 14:09:33,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 697 flow. Second operand has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:09:33,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:33,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-10-11 14:09:33,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:37,784 INFO L124 PetriNetUnfolderBase]: 1537/2851 cut-off events. [2024-10-11 14:09:37,785 INFO L125 PetriNetUnfolderBase]: For 7169/7169 co-relation queries the response was YES. [2024-10-11 14:09:37,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9392 conditions, 2851 events. 1537/2851 cut-off events. For 7169/7169 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 15797 event pairs, 190 based on Foata normal form. 18/2859 useless extension candidates. Maximal degree in co-relation 9364. Up to 1006 conditions per place. [2024-10-11 14:09:37,806 INFO L140 encePairwiseOnDemand]: 34/47 looper letters, 138 selfloop transitions, 62 changer transitions 4/207 dead transitions. [2024-10-11 14:09:37,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 207 transitions, 1737 flow [2024-10-11 14:09:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 14:09:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-10-11 14:09:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 253 transitions. [2024-10-11 14:09:37,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3588652482269504 [2024-10-11 14:09:37,809 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 697 flow. Second operand 15 states and 253 transitions. [2024-10-11 14:09:37,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 207 transitions, 1737 flow [2024-10-11 14:09:37,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 207 transitions, 1651 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-10-11 14:09:37,837 INFO L231 Difference]: Finished difference. Result has 107 places, 122 transitions, 1243 flow [2024-10-11 14:09:37,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1243, PETRI_PLACES=107, PETRI_TRANSITIONS=122} [2024-10-11 14:09:37,837 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2024-10-11 14:09:37,837 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 122 transitions, 1243 flow [2024-10-11 14:09:37,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:09:37,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:37,838 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-10-11 14:09:37,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:09:38,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 14:09:38,040 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-10-11 14:09:38,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:38,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1442743228, now seen corresponding path program 2 times [2024-10-11 14:09:38,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:38,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457047761] [2024-10-11 14:09:38,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457047761] [2024-10-11 14:09:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457047761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:39,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681370984] [2024-10-11 14:09:39,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:09:39,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:39,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:39,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:09:39,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:09:39,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:09:39,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 14:09:39,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:39,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 14:09:39,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-10-11 14:09:39,815 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-10-11 14:09:40,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-10-11 14:09:40,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-11 14:09:40,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-10-11 14:09:40,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2024-10-11 14:09:41,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:41,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:41,485 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:41,486 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-10-11 14:09:41,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:41,496 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-10-11 14:09:48,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:09:48,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-10-11 14:09:48,277 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:09:48,277 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-10-11 14:09:50,443 INFO L349 Elim1Store]: treesize reduction 5, result has 92.5 percent of original size [2024-10-11 14:09:50,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 1226 treesize of output 807 [2024-10-11 14:09:50,556 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 14:09:50,607 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-11 14:09:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:09:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681370984] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:51,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-10-11 14:09:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484127391] [2024-10-11 14:09:51,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:51,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 14:09:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:51,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 14:09:51,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2024-10-11 14:09:55,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 14:09:59,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 14:09:59,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2024-10-11 14:09:59,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 122 transitions, 1243 flow. Second operand has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:09:59,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:59,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2024-10-11 14:09:59,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:10:05,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 14:10:10,312 INFO L124 PetriNetUnfolderBase]: 2393/4331 cut-off events. [2024-10-11 14:10:10,312 INFO L125 PetriNetUnfolderBase]: For 16162/16162 co-relation queries the response was YES. [2024-10-11 14:10:10,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15854 conditions, 4331 events. 2393/4331 cut-off events. For 16162/16162 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 25591 event pairs, 162 based on Foata normal form. 0/4310 useless extension candidates. Maximal degree in co-relation 15819. Up to 782 conditions per place. [2024-10-11 14:10:10,340 INFO L140 encePairwiseOnDemand]: 33/47 looper letters, 230 selfloop transitions, 115 changer transitions 5/353 dead transitions. [2024-10-11 14:10:10,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 353 transitions, 3414 flow [2024-10-11 14:10:10,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 14:10:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-11 14:10:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 412 transitions. [2024-10-11 14:10:10,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36524822695035464 [2024-10-11 14:10:10,346 INFO L175 Difference]: Start difference. First operand has 107 places, 122 transitions, 1243 flow. Second operand 24 states and 412 transitions. [2024-10-11 14:10:10,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 353 transitions, 3414 flow [2024-10-11 14:10:10,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 353 transitions, 3234 flow, removed 80 selfloop flow, removed 4 redundant places. [2024-10-11 14:10:10,405 INFO L231 Difference]: Finished difference. Result has 140 places, 185 transitions, 2204 flow [2024-10-11 14:10:10,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2204, PETRI_PLACES=140, PETRI_TRANSITIONS=185} [2024-10-11 14:10:10,406 INFO L277 CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places. [2024-10-11 14:10:10,406 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 185 transitions, 2204 flow [2024-10-11 14:10:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.857142857142858) internal successors, (276), 28 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:10:10,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:10:10,407 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-10-11 14:10:10,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:10:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:10,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:10:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:10:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1909824166, now seen corresponding path program 3 times [2024-10-11 14:10:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:10:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462483025] [2024-10-11 14:10:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:10:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:10:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:10:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:10:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462483025] [2024-10-11 14:10:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462483025] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:10:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736970485] [2024-10-11 14:10:11,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:10:11,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:10:11,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:10:11,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:10:11,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:10:11,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 14:10:11,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:10:11,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 14:10:11,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:10:11,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-10-11 14:10:12,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-10-11 14:10:12,155 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-10-11 14:10:12,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2024-10-11 14:10:12,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:10:12,359 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 57 treesize of output 37 [2024-10-11 14:10:12,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:10:12,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-10-11 14:10:12,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:10:12,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 26 [2024-10-11 14:10:12,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-10-11 14:10:12,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2024-10-11 14:10:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:10:12,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:10:13,206 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-10-11 14:10:13,207 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-10-11 14:10:13,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:10:13,221 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