/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:44:37,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:44:37,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:44:37,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:44:37,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:44:37,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:44:37,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:44:37,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:44:37,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:44:37,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:44:37,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:44:37,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:44:37,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:44:37,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:44:37,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:44:37,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:44:37,239 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:44:37,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:44:37,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:44:37,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:44:37,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:44:37,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:44:37,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:44:37,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:44:37,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:44:37,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:44:37,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:44:37,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:44:37,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:44:37,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:44:37,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:44:37,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:44:37,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:44:37,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:44:37,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:44:37,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:44:37,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:44:37,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:44:37,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:44:37,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:44:37,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:44:37,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 20:44:37,285 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:44:37,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:44:37,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:44:37,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:44:37,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:44:37,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:44:37,288 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:44:37,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:44:37,288 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:44:37,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:44:37,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:44:37,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:44:37,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:44:37,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:44:37,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 20:44:37,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:44:37,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:44:37,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:44:37,547 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:44:37,555 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:44:37,556 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2022-12-11 20:44:38,590 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:44:38,817 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:44:38,818 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2022-12-11 20:44:38,828 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88aedeaf2/ccea1b7bfa244a6a998a13147dfaf21e/FLAG69346a72a [2022-12-11 20:44:38,838 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88aedeaf2/ccea1b7bfa244a6a998a13147dfaf21e [2022-12-11 20:44:38,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:44:38,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:44:38,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:44:38,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:44:38,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:44:38,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:44:38" (1/1) ... [2022-12-11 20:44:38,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95a3e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:38, skipping insertion in model container [2022-12-11 20:44:38,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:44:38" (1/1) ... [2022-12-11 20:44:38,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:44:38,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:44:39,162 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-12-11 20:44:39,168 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-12-11 20:44:39,172 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-12-11 20:44:39,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:44:39,188 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:44:39,238 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2022-12-11 20:44:39,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2022-12-11 20:44:39,241 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2022-12-11 20:44:39,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:44:39,291 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:44:39,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39 WrapperNode [2022-12-11 20:44:39,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:44:39,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:44:39,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:44:39,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:44:39,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,351 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-11 20:44:39,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:44:39,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:44:39,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:44:39,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:44:39,359 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,387 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:44:39,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:44:39,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:44:39,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:44:39,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (1/1) ... [2022-12-11 20:44:39,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:44:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:44:39,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-11 20:44:39,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-11 20:44:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-11 20:44:39,478 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-11 20:44:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:44:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:44:39,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:44:39,480 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:44:39,582 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:44:39,583 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:44:39,862 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:44:39,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:44:39,881 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-11 20:44:39,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:44:39 BoogieIcfgContainer [2022-12-11 20:44:39,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:44:39,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:44:39,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:44:39,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:44:39,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:44:38" (1/3) ... [2022-12-11 20:44:39,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621bb273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:44:39, skipping insertion in model container [2022-12-11 20:44:39,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:44:39" (2/3) ... [2022-12-11 20:44:39,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621bb273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:44:39, skipping insertion in model container [2022-12-11 20:44:39,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:44:39" (3/3) ... [2022-12-11 20:44:39,889 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2022-12-11 20:44:39,901 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:44:39,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-11 20:44:39,901 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:44:40,018 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 20:44:40,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-11 20:44:40,164 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-11 20:44:40,165 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 20:44:40,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 254 events. 15/254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-11 20:44:40,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-11 20:44:40,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-11 20:44:40,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:44:40,194 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2a5b8f98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:44:40,195 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 20:44:40,203 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-11 20:44:40,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:44:40,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:40,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:40,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash 812412170, now seen corresponding path program 1 times [2022-12-11 20:44:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:40,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748826176] [2022-12-11 20:44:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:40,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748826176] [2022-12-11 20:44:40,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748826176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:40,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:40,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 20:44:40,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358455502] [2022-12-11 20:44:40,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:40,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-11 20:44:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-11 20:44:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-11 20:44:40,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 256 [2022-12-11 20:44:40,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 245 transitions, 499 flow. Second operand has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 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) [2022-12-11 20:44:40,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:40,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 256 [2022-12-11 20:44:40,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:40,533 INFO L130 PetriNetUnfolder]: 10/234 cut-off events. [2022-12-11 20:44:40,533 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-11 20:44:40,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 234 events. 10/234 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 280 event pairs, 0 based on Foata normal form. 7/229 useless extension candidates. Maximal degree in co-relation 176. Up to 4 conditions per place. [2022-12-11 20:44:40,536 INFO L137 encePairwiseOnDemand]: 251/256 looper letters, 3 selfloop transitions, 0 changer transitions 0/234 dead transitions. [2022-12-11 20:44:40,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 234 transitions, 483 flow [2022-12-11 20:44:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-11 20:44:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-11 20:44:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 494 transitions. [2022-12-11 20:44:40,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.96484375 [2022-12-11 20:44:40,554 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, -5 predicate places. [2022-12-11 20:44:40,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 234 transitions, 483 flow [2022-12-11 20:44:40,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 234 transitions, 483 flow [2022-12-11 20:44:40,558 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 234 transitions, 483 flow [2022-12-11 20:44:40,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 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) [2022-12-11 20:44:40,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:40,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:40,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:44:40,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:40,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:40,560 INFO L85 PathProgramCache]: Analyzing trace with hash -510713771, now seen corresponding path program 1 times [2022-12-11 20:44:40,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:40,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075506482] [2022-12-11 20:44:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:41,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075506482] [2022-12-11 20:44:41,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075506482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:41,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:41,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 20:44:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040215565] [2022-12-11 20:44:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:41,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 20:44:41,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:41,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 20:44:41,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-11 20:44:41,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 256 [2022-12-11 20:44:41,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 234 transitions, 483 flow. Second operand has 12 states, 12 states have (on average 181.75) internal successors, (2181), 12 states have internal predecessors, (2181), 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) [2022-12-11 20:44:41,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:41,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 256 [2022-12-11 20:44:41,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:42,046 INFO L130 PetriNetUnfolder]: 995/3867 cut-off events. [2022-12-11 20:44:42,046 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-11 20:44:42,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5428 conditions, 3867 events. 995/3867 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 31436 event pairs, 789 based on Foata normal form. 0/3596 useless extension candidates. Maximal degree in co-relation 5219. Up to 1435 conditions per place. [2022-12-11 20:44:42,063 INFO L137 encePairwiseOnDemand]: 243/256 looper letters, 52 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2022-12-11 20:44:42,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 230 transitions, 603 flow [2022-12-11 20:44:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:44:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:44:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2392 transitions. [2022-12-11 20:44:42,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-11 20:44:42,104 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 4 predicate places. [2022-12-11 20:44:42,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 230 transitions, 603 flow [2022-12-11 20:44:42,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 230 transitions, 603 flow [2022-12-11 20:44:42,113 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 230 transitions, 603 flow [2022-12-11 20:44:42,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 181.75) internal successors, (2181), 12 states have internal predecessors, (2181), 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) [2022-12-11 20:44:42,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:42,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:42,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:44:42,116 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:42,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:42,117 INFO L85 PathProgramCache]: Analyzing trace with hash 662506766, now seen corresponding path program 1 times [2022-12-11 20:44:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:42,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429688723] [2022-12-11 20:44:42,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:42,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429688723] [2022-12-11 20:44:42,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429688723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:42,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:42,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 20:44:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182322843] [2022-12-11 20:44:42,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:42,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 20:44:42,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:42,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 20:44:42,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 20:44:42,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 256 [2022-12-11 20:44:42,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 230 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 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) [2022-12-11 20:44:42,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:42,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 256 [2022-12-11 20:44:42,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:42,574 INFO L130 PetriNetUnfolder]: 996/3856 cut-off events. [2022-12-11 20:44:42,574 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-11 20:44:42,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 3856 events. 996/3856 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 31321 event pairs, 785 based on Foata normal form. 0/3600 useless extension candidates. Maximal degree in co-relation 5392. Up to 1445 conditions per place. [2022-12-11 20:44:42,590 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 9 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2022-12-11 20:44:42,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 230 transitions, 645 flow [2022-12-11 20:44:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-11 20:44:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-11 20:44:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 943 transitions. [2022-12-11 20:44:42,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9208984375 [2022-12-11 20:44:42,594 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 6 predicate places. [2022-12-11 20:44:42,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 230 transitions, 645 flow [2022-12-11 20:44:42,606 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 230 transitions, 645 flow [2022-12-11 20:44:42,606 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 230 transitions, 645 flow [2022-12-11 20:44:42,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 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) [2022-12-11 20:44:42,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:42,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:42,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:44:42,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash 314833467, now seen corresponding path program 1 times [2022-12-11 20:44:42,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:42,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024693662] [2022-12-11 20:44:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:42,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:42,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024693662] [2022-12-11 20:44:42,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024693662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:42,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:42,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 20:44:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089212262] [2022-12-11 20:44:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:44:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:44:42,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:44:42,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 256 [2022-12-11 20:44:42,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 230 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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) [2022-12-11 20:44:42,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:42,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 256 [2022-12-11 20:44:42,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:43,010 INFO L130 PetriNetUnfolder]: 567/2547 cut-off events. [2022-12-11 20:44:43,010 INFO L131 PetriNetUnfolder]: For 715/715 co-relation queries the response was YES. [2022-12-11 20:44:43,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3918 conditions, 2547 events. 567/2547 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 16630 event pairs, 437 based on Foata normal form. 0/2407 useless extension candidates. Maximal degree in co-relation 3565. Up to 891 conditions per place. [2022-12-11 20:44:43,018 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 13 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2022-12-11 20:44:43,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 235 transitions, 714 flow [2022-12-11 20:44:43,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:44:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:44:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2022-12-11 20:44:43,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9440104166666666 [2022-12-11 20:44:43,021 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 8 predicate places. [2022-12-11 20:44:43,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 235 transitions, 714 flow [2022-12-11 20:44:43,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 235 transitions, 714 flow [2022-12-11 20:44:43,027 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 235 transitions, 714 flow [2022-12-11 20:44:43,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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) [2022-12-11 20:44:43,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:43,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:43,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:44:43,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1038158996, now seen corresponding path program 1 times [2022-12-11 20:44:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:43,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531667699] [2022-12-11 20:44:43,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:43,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:43,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531667699] [2022-12-11 20:44:43,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531667699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:43,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:43,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 20:44:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318283194] [2022-12-11 20:44:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:43,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 20:44:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:43,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 20:44:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 20:44:43,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 256 [2022-12-11 20:44:43,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 235 transitions, 714 flow. Second operand has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 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) [2022-12-11 20:44:43,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:43,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 256 [2022-12-11 20:44:43,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:43,557 INFO L130 PetriNetUnfolder]: 1088/4777 cut-off events. [2022-12-11 20:44:43,558 INFO L131 PetriNetUnfolder]: For 2008/2008 co-relation queries the response was YES. [2022-12-11 20:44:43,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7508 conditions, 4777 events. 1088/4777 cut-off events. For 2008/2008 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 39054 event pairs, 829 based on Foata normal form. 0/4515 useless extension candidates. Maximal degree in co-relation 6860. Up to 1693 conditions per place. [2022-12-11 20:44:43,581 INFO L137 encePairwiseOnDemand]: 251/256 looper letters, 24 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2022-12-11 20:44:43,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 247 transitions, 884 flow [2022-12-11 20:44:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 20:44:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 20:44:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-12-11 20:44:43,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.93046875 [2022-12-11 20:44:43,587 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 12 predicate places. [2022-12-11 20:44:43,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 247 transitions, 884 flow [2022-12-11 20:44:43,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 247 transitions, 884 flow [2022-12-11 20:44:43,601 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 884 flow [2022-12-11 20:44:43,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 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) [2022-12-11 20:44:43,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:43,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:43,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:44:43,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:43,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1520880418, now seen corresponding path program 1 times [2022-12-11 20:44:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:43,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864859915] [2022-12-11 20:44:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864859915] [2022-12-11 20:44:44,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864859915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:44,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:44,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-11 20:44:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801742105] [2022-12-11 20:44:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:44,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-11 20:44:44,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-11 20:44:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-11 20:44:44,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 256 [2022-12-11 20:44:44,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 884 flow. Second operand has 17 states, 17 states have (on average 169.41176470588235) internal successors, (2880), 17 states have internal predecessors, (2880), 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) [2022-12-11 20:44:44,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:44,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 256 [2022-12-11 20:44:44,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:45,657 INFO L130 PetriNetUnfolder]: 1699/6773 cut-off events. [2022-12-11 20:44:45,658 INFO L131 PetriNetUnfolder]: For 4009/4027 co-relation queries the response was YES. [2022-12-11 20:44:45,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13088 conditions, 6773 events. 1699/6773 cut-off events. For 4009/4027 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 59269 event pairs, 1273 based on Foata normal form. 0/6389 useless extension candidates. Maximal degree in co-relation 12310. Up to 2703 conditions per place. [2022-12-11 20:44:45,689 INFO L137 encePairwiseOnDemand]: 240/256 looper letters, 92 selfloop transitions, 20 changer transitions 0/269 dead transitions. [2022-12-11 20:44:45,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 269 transitions, 1193 flow [2022-12-11 20:44:45,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 20:44:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 20:44:45,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2606 transitions. [2022-12-11 20:44:45,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6786458333333333 [2022-12-11 20:44:45,695 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 26 predicate places. [2022-12-11 20:44:45,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 269 transitions, 1193 flow [2022-12-11 20:44:45,712 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 269 transitions, 1193 flow [2022-12-11 20:44:45,713 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 269 transitions, 1193 flow [2022-12-11 20:44:45,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 169.41176470588235) internal successors, (2880), 17 states have internal predecessors, (2880), 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) [2022-12-11 20:44:45,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:45,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:44:45,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1493657272, now seen corresponding path program 1 times [2022-12-11 20:44:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:45,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713622998] [2022-12-11 20:44:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:47,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:47,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713622998] [2022-12-11 20:44:47,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713622998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:47,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:47,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-12-11 20:44:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436237170] [2022-12-11 20:44:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:47,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-11 20:44:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-11 20:44:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-12-11 20:44:47,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 256 [2022-12-11 20:44:47,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 269 transitions, 1193 flow. Second operand has 27 states, 27 states have (on average 155.92592592592592) internal successors, (4210), 27 states have internal predecessors, (4210), 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) [2022-12-11 20:44:47,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:47,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 256 [2022-12-11 20:44:47,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:50,256 INFO L130 PetriNetUnfolder]: 1895/7270 cut-off events. [2022-12-11 20:44:50,256 INFO L131 PetriNetUnfolder]: For 7050/7086 co-relation queries the response was YES. [2022-12-11 20:44:50,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16761 conditions, 7270 events. 1895/7270 cut-off events. For 7050/7086 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 64699 event pairs, 1422 based on Foata normal form. 2/6871 useless extension candidates. Maximal degree in co-relation 15849. Up to 2813 conditions per place. [2022-12-11 20:44:50,297 INFO L137 encePairwiseOnDemand]: 225/256 looper letters, 103 selfloop transitions, 45 changer transitions 0/299 dead transitions. [2022-12-11 20:44:50,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 299 transitions, 1640 flow [2022-12-11 20:44:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 20:44:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 20:44:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4292 transitions. [2022-12-11 20:44:50,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6209490740740741 [2022-12-11 20:44:50,305 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 52 predicate places. [2022-12-11 20:44:50,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 289 places, 299 transitions, 1640 flow [2022-12-11 20:44:50,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 299 transitions, 1640 flow [2022-12-11 20:44:50,327 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 299 transitions, 1640 flow [2022-12-11 20:44:50,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 155.92592592592592) internal successors, (4210), 27 states have internal predecessors, (4210), 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) [2022-12-11 20:44:50,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:50,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:50,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:44:50,329 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:50,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:50,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2011179461, now seen corresponding path program 1 times [2022-12-11 20:44:50,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:50,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307664886] [2022-12-11 20:44:50,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:50,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:51,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:51,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307664886] [2022-12-11 20:44:51,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307664886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:51,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:51,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-11 20:44:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424461624] [2022-12-11 20:44:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:51,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 20:44:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:51,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 20:44:51,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-12-11 20:44:51,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 256 [2022-12-11 20:44:51,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 299 transitions, 1640 flow. Second operand has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 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) [2022-12-11 20:44:51,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:51,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 256 [2022-12-11 20:44:51,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:52,720 INFO L130 PetriNetUnfolder]: 1887/7242 cut-off events. [2022-12-11 20:44:52,720 INFO L131 PetriNetUnfolder]: For 10280/10330 co-relation queries the response was YES. [2022-12-11 20:44:52,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19548 conditions, 7242 events. 1887/7242 cut-off events. For 10280/10330 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 64972 event pairs, 804 based on Foata normal form. 0/6845 useless extension candidates. Maximal degree in co-relation 18499. Up to 2800 conditions per place. [2022-12-11 20:44:52,754 INFO L137 encePairwiseOnDemand]: 239/256 looper letters, 123 selfloop transitions, 24 changer transitions 0/306 dead transitions. [2022-12-11 20:44:52,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 306 transitions, 2053 flow [2022-12-11 20:44:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 20:44:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 20:44:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2467 transitions. [2022-12-11 20:44:52,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424479166666667 [2022-12-11 20:44:52,759 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 64 predicate places. [2022-12-11 20:44:52,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 306 transitions, 2053 flow [2022-12-11 20:44:52,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 306 transitions, 2053 flow [2022-12-11 20:44:52,779 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 306 transitions, 2053 flow [2022-12-11 20:44:52,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 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) [2022-12-11 20:44:52,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:52,780 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:44:52,780 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash 206860257, now seen corresponding path program 1 times [2022-12-11 20:44:52,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:52,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760939388] [2022-12-11 20:44:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:54,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:54,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760939388] [2022-12-11 20:44:54,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760939388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:54,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:54,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-11 20:44:54,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867191137] [2022-12-11 20:44:54,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:54,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-11 20:44:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:54,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-11 20:44:54,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2022-12-11 20:44:54,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 256 [2022-12-11 20:44:54,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 306 transitions, 2053 flow. Second operand has 28 states, 28 states have (on average 147.14285714285714) internal successors, (4120), 28 states have internal predecessors, (4120), 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) [2022-12-11 20:44:54,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:54,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 256 [2022-12-11 20:44:54,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:57,312 INFO L130 PetriNetUnfolder]: 1011/3783 cut-off events. [2022-12-11 20:44:57,313 INFO L131 PetriNetUnfolder]: For 8169/8347 co-relation queries the response was YES. [2022-12-11 20:44:57,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12116 conditions, 3783 events. 1011/3783 cut-off events. For 8169/8347 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27819 event pairs, 402 based on Foata normal form. 0/3569 useless extension candidates. Maximal degree in co-relation 11397. Up to 1503 conditions per place. [2022-12-11 20:44:57,332 INFO L137 encePairwiseOnDemand]: 228/256 looper letters, 139 selfloop transitions, 42 changer transitions 1/315 dead transitions. [2022-12-11 20:44:57,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 315 transitions, 2645 flow [2022-12-11 20:44:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-11 20:44:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-11 20:44:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3907 transitions. [2022-12-11 20:44:57,337 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5869891826923077 [2022-12-11 20:44:57,338 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 81 predicate places. [2022-12-11 20:44:57,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 318 places, 315 transitions, 2645 flow [2022-12-11 20:44:57,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 318 places, 314 transitions, 2633 flow [2022-12-11 20:44:57,350 INFO L495 AbstractCegarLoop]: Abstraction has has 318 places, 314 transitions, 2633 flow [2022-12-11 20:44:57,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 147.14285714285714) internal successors, (4120), 28 states have internal predecessors, (4120), 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) [2022-12-11 20:44:57,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:57,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:57,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 20:44:57,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -67959762, now seen corresponding path program 1 times [2022-12-11 20:44:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875020248] [2022-12-11 20:44:57,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:57,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:57,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875020248] [2022-12-11 20:44:57,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875020248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:57,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:57,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 20:44:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523638685] [2022-12-11 20:44:57,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:57,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:44:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:44:57,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:44:57,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 256 [2022-12-11 20:44:57,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 314 transitions, 2633 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2022-12-11 20:44:57,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:57,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 256 [2022-12-11 20:44:57,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:44:57,605 INFO L130 PetriNetUnfolder]: 382/1570 cut-off events. [2022-12-11 20:44:57,606 INFO L131 PetriNetUnfolder]: For 6535/6559 co-relation queries the response was YES. [2022-12-11 20:44:57,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 1570 events. 382/1570 cut-off events. For 6535/6559 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8423 event pairs, 25 based on Foata normal form. 21/1528 useless extension candidates. Maximal degree in co-relation 5337. Up to 677 conditions per place. [2022-12-11 20:44:57,611 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 40 selfloop transitions, 6 changer transitions 2/320 dead transitions. [2022-12-11 20:44:57,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 320 transitions, 2867 flow [2022-12-11 20:44:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:44:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:44:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2022-12-11 20:44:57,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.92578125 [2022-12-11 20:44:57,613 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 83 predicate places. [2022-12-11 20:44:57,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 320 transitions, 2867 flow [2022-12-11 20:44:57,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 320 places, 318 transitions, 2817 flow [2022-12-11 20:44:57,617 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 318 transitions, 2817 flow [2022-12-11 20:44:57,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2022-12-11 20:44:57,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:44:57,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:44:57,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 20:44:57,618 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:44:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:44:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash -853986226, now seen corresponding path program 1 times [2022-12-11 20:44:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:44:57,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209877021] [2022-12-11 20:44:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:44:57,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:44:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:44:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:44:59,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:44:59,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209877021] [2022-12-11 20:44:59,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209877021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:44:59,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:44:59,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-11 20:44:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714493415] [2022-12-11 20:44:59,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:44:59,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-11 20:44:59,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:44:59,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-11 20:44:59,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-12-11 20:44:59,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 256 [2022-12-11 20:44:59,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 318 transitions, 2817 flow. Second operand has 29 states, 29 states have (on average 151.68965517241378) internal successors, (4399), 29 states have internal predecessors, (4399), 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) [2022-12-11 20:44:59,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:44:59,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 256 [2022-12-11 20:44:59,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:45:01,741 INFO L130 PetriNetUnfolder]: 535/2218 cut-off events. [2022-12-11 20:45:01,742 INFO L131 PetriNetUnfolder]: For 11400/11507 co-relation queries the response was YES. [2022-12-11 20:45:01,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9965 conditions, 2218 events. 535/2218 cut-off events. For 11400/11507 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13342 event pairs, 61 based on Foata normal form. 5/2125 useless extension candidates. Maximal degree in co-relation 8879. Up to 1001 conditions per place. [2022-12-11 20:45:01,753 INFO L137 encePairwiseOnDemand]: 221/256 looper letters, 206 selfloop transitions, 69 changer transitions 0/408 dead transitions. [2022-12-11 20:45:01,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 408 transitions, 4714 flow [2022-12-11 20:45:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-11 20:45:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-11 20:45:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4963 transitions. [2022-12-11 20:45:01,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6058349609375 [2022-12-11 20:45:01,787 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 114 predicate places. [2022-12-11 20:45:01,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 351 places, 408 transitions, 4714 flow [2022-12-11 20:45:01,796 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 351 places, 408 transitions, 4714 flow [2022-12-11 20:45:01,796 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 408 transitions, 4714 flow [2022-12-11 20:45:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 151.68965517241378) internal successors, (4399), 29 states have internal predecessors, (4399), 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) [2022-12-11 20:45:01,798 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:45:01,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:45:01,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 20:45:01,798 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:45:01,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:45:01,798 INFO L85 PathProgramCache]: Analyzing trace with hash 522133514, now seen corresponding path program 2 times [2022-12-11 20:45:01,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:45:01,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622998622] [2022-12-11 20:45:01,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:45:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:45:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:45:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:45:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:45:03,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622998622] [2022-12-11 20:45:03,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622998622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:45:03,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:45:03,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-12-11 20:45:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880958691] [2022-12-11 20:45:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:45:03,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-11 20:45:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:45:03,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-11 20:45:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-12-11 20:45:03,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 256 [2022-12-11 20:45:03,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 408 transitions, 4714 flow. Second operand has 30 states, 30 states have (on average 157.4) internal successors, (4722), 30 states have internal predecessors, (4722), 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) [2022-12-11 20:45:03,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:45:03,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 256 [2022-12-11 20:45:03,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:45:05,214 INFO L130 PetriNetUnfolder]: 439/1843 cut-off events. [2022-12-11 20:45:05,215 INFO L131 PetriNetUnfolder]: For 10941/11054 co-relation queries the response was YES. [2022-12-11 20:45:05,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9241 conditions, 1843 events. 439/1843 cut-off events. For 10941/11054 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10245 event pairs, 17 based on Foata normal form. 4/1774 useless extension candidates. Maximal degree in co-relation 8345. Up to 819 conditions per place. [2022-12-11 20:45:05,222 INFO L137 encePairwiseOnDemand]: 224/256 looper letters, 206 selfloop transitions, 64 changer transitions 0/409 dead transitions. [2022-12-11 20:45:05,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 409 transitions, 5251 flow [2022-12-11 20:45:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 20:45:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 20:45:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4335 transitions. [2022-12-11 20:45:05,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6271701388888888 [2022-12-11 20:45:05,227 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 140 predicate places. [2022-12-11 20:45:05,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 409 transitions, 5251 flow [2022-12-11 20:45:05,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 377 places, 409 transitions, 5251 flow [2022-12-11 20:45:05,233 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 409 transitions, 5251 flow [2022-12-11 20:45:05,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 157.4) internal successors, (4722), 30 states have internal predecessors, (4722), 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) [2022-12-11 20:45:05,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:45:05,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:45:05,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 20:45:05,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:45:05,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:45:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -143184009, now seen corresponding path program 1 times [2022-12-11 20:45:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:45:05,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644389591] [2022-12-11 20:45:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:45:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:45:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:45:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:45:09,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:45:09,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644389591] [2022-12-11 20:45:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644389591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:45:09,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:45:09,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-12-11 20:45:09,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979355315] [2022-12-11 20:45:09,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:45:09,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-11 20:45:09,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:45:09,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-11 20:45:09,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2022-12-11 20:45:09,268 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 256 [2022-12-11 20:45:09,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 409 transitions, 5251 flow. Second operand has 35 states, 35 states have (on average 139.54285714285714) internal successors, (4884), 35 states have internal predecessors, (4884), 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) [2022-12-11 20:45:09,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:45:09,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 256 [2022-12-11 20:45:09,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:45:12,381 INFO L130 PetriNetUnfolder]: 535/2193 cut-off events. [2022-12-11 20:45:12,382 INFO L131 PetriNetUnfolder]: For 17017/17126 co-relation queries the response was YES. [2022-12-11 20:45:12,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11989 conditions, 2193 events. 535/2193 cut-off events. For 17017/17126 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 12787 event pairs, 32 based on Foata normal form. 6/2113 useless extension candidates. Maximal degree in co-relation 10302. Up to 968 conditions per place. [2022-12-11 20:45:12,391 INFO L137 encePairwiseOnDemand]: 220/256 looper letters, 266 selfloop transitions, 63 changer transitions 0/453 dead transitions. [2022-12-11 20:45:12,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 453 transitions, 6684 flow [2022-12-11 20:45:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-11 20:45:12,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-11 20:45:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4717 transitions. [2022-12-11 20:45:12,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5583570075757576 [2022-12-11 20:45:12,396 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 172 predicate places. [2022-12-11 20:45:12,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 409 places, 453 transitions, 6684 flow [2022-12-11 20:45:12,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 409 places, 453 transitions, 6684 flow [2022-12-11 20:45:12,405 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 453 transitions, 6684 flow [2022-12-11 20:45:12,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 139.54285714285714) internal successors, (4884), 35 states have internal predecessors, (4884), 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) [2022-12-11 20:45:12,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:45:12,406 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:45:12,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 20:45:12,406 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:45:12,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:45:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2027119896, now seen corresponding path program 1 times [2022-12-11 20:45:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:45:12,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285120262] [2022-12-11 20:45:12,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:45:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:45:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:45:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:45:17,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:45:17,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285120262] [2022-12-11 20:45:17,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285120262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:45:17,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:45:17,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-12-11 20:45:17,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640770993] [2022-12-11 20:45:17,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:45:17,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-11 20:45:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:45:17,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-11 20:45:17,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1817, Unknown=0, NotChecked=0, Total=1980 [2022-12-11 20:45:17,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-11 20:45:17,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 453 transitions, 6684 flow. Second operand has 45 states, 45 states have (on average 120.35555555555555) internal successors, (5416), 45 states have internal predecessors, (5416), 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) [2022-12-11 20:45:17,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:45:17,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-11 20:45:17,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:45:28,140 INFO L130 PetriNetUnfolder]: 4965/11377 cut-off events. [2022-12-11 20:45:28,140 INFO L131 PetriNetUnfolder]: For 88616/88862 co-relation queries the response was YES. [2022-12-11 20:45:28,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57894 conditions, 11377 events. 4965/11377 cut-off events. For 88616/88862 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 82901 event pairs, 1098 based on Foata normal form. 2/10499 useless extension candidates. Maximal degree in co-relation 53903. Up to 5799 conditions per place. [2022-12-11 20:45:28,200 INFO L137 encePairwiseOnDemand]: 202/256 looper letters, 574 selfloop transitions, 117 changer transitions 40/848 dead transitions. [2022-12-11 20:45:28,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 848 transitions, 12231 flow [2022-12-11 20:45:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-12-11 20:45:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-12-11 20:45:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 8182 transitions. [2022-12-11 20:45:28,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49170673076923077 [2022-12-11 20:45:28,207 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 236 predicate places. [2022-12-11 20:45:28,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 473 places, 848 transitions, 12231 flow [2022-12-11 20:45:28,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 473 places, 808 transitions, 11242 flow [2022-12-11 20:45:28,245 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 808 transitions, 11242 flow [2022-12-11 20:45:28,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 120.35555555555555) internal successors, (5416), 45 states have internal predecessors, (5416), 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) [2022-12-11 20:45:28,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:45:28,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:45:28,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 20:45:28,246 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:45:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:45:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1740620398, now seen corresponding path program 2 times [2022-12-11 20:45:28,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:45:28,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493996610] [2022-12-11 20:45:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:45:28,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:45:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:45:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:45:33,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:45:33,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493996610] [2022-12-11 20:45:33,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493996610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:45:33,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:45:33,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-12-11 20:45:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832437788] [2022-12-11 20:45:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:45:33,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-11 20:45:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:45:33,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-11 20:45:33,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1879, Unknown=0, NotChecked=0, Total=2070 [2022-12-11 20:45:33,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-11 20:45:33,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 808 transitions, 11242 flow. Second operand has 46 states, 46 states have (on average 120.30434782608695) internal successors, (5534), 46 states have internal predecessors, (5534), 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) [2022-12-11 20:45:33,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:45:33,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-11 20:45:33,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:45:42,920 INFO L130 PetriNetUnfolder]: 5908/13624 cut-off events. [2022-12-11 20:45:42,920 INFO L131 PetriNetUnfolder]: For 114557/115459 co-relation queries the response was YES. [2022-12-11 20:45:42,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78082 conditions, 13624 events. 5908/13624 cut-off events. For 114557/115459 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 103828 event pairs, 936 based on Foata normal form. 2/12658 useless extension candidates. Maximal degree in co-relation 73385. Up to 7511 conditions per place. [2022-12-11 20:45:42,997 INFO L137 encePairwiseOnDemand]: 201/256 looper letters, 908 selfloop transitions, 107 changer transitions 32/1164 dead transitions. [2022-12-11 20:45:42,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 1164 transitions, 17402 flow [2022-12-11 20:45:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-11 20:45:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-12-11 20:45:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 7311 transitions. [2022-12-11 20:45:43,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4923895474137931 [2022-12-11 20:45:43,003 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 293 predicate places. [2022-12-11 20:45:43,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 530 places, 1164 transitions, 17402 flow [2022-12-11 20:45:43,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 530 places, 1132 transitions, 16670 flow [2022-12-11 20:45:43,055 INFO L495 AbstractCegarLoop]: Abstraction has has 530 places, 1132 transitions, 16670 flow [2022-12-11 20:45:43,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 120.30434782608695) internal successors, (5534), 46 states have internal predecessors, (5534), 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) [2022-12-11 20:45:43,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:45:43,056 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:45:43,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 20:45:43,056 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:45:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:45:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -349950318, now seen corresponding path program 3 times [2022-12-11 20:45:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:45:43,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419868096] [2022-12-11 20:45:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:45:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:45:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:46:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:46:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:46:00,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419868096] [2022-12-11 20:46:00,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419868096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:46:00,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:46:00,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-12-11 20:46:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638798605] [2022-12-11 20:46:00,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:46:00,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-11 20:46:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:46:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-11 20:46:00,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1710, Unknown=0, NotChecked=0, Total=1892 [2022-12-11 20:46:00,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-11 20:46:00,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 1132 transitions, 16670 flow. Second operand has 44 states, 44 states have (on average 120.4090909090909) internal successors, (5298), 44 states have internal predecessors, (5298), 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) [2022-12-11 20:46:00,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:46:00,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-11 20:46:00,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:46:10,949 INFO L130 PetriNetUnfolder]: 6945/16075 cut-off events. [2022-12-11 20:46:10,950 INFO L131 PetriNetUnfolder]: For 151135/152334 co-relation queries the response was YES. [2022-12-11 20:46:10,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103367 conditions, 16075 events. 6945/16075 cut-off events. For 151135/152334 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 128151 event pairs, 1040 based on Foata normal form. 2/15021 useless extension candidates. Maximal degree in co-relation 97622. Up to 9346 conditions per place. [2022-12-11 20:46:11,055 INFO L137 encePairwiseOnDemand]: 202/256 looper letters, 1192 selfloop transitions, 121 changer transitions 26/1456 dead transitions. [2022-12-11 20:46:11,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 1456 transitions, 24150 flow [2022-12-11 20:46:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-11 20:46:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-11 20:46:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 7566 transitions. [2022-12-11 20:46:11,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.492578125 [2022-12-11 20:46:11,069 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 352 predicate places. [2022-12-11 20:46:11,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 589 places, 1456 transitions, 24150 flow [2022-12-11 20:46:11,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 589 places, 1430 transitions, 23402 flow [2022-12-11 20:46:11,177 INFO L495 AbstractCegarLoop]: Abstraction has has 589 places, 1430 transitions, 23402 flow [2022-12-11 20:46:11,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 120.4090909090909) internal successors, (5298), 44 states have internal predecessors, (5298), 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) [2022-12-11 20:46:11,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:46:11,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:46:11,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 20:46:11,180 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:46:11,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:46:11,180 INFO L85 PathProgramCache]: Analyzing trace with hash -288540722, now seen corresponding path program 4 times [2022-12-11 20:46:11,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:46:11,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364300195] [2022-12-11 20:46:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:46:11,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:46:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:46:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:46:17,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:46:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364300195] [2022-12-11 20:46:17,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364300195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:46:17,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:46:17,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-12-11 20:46:17,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024463877] [2022-12-11 20:46:17,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:46:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-11 20:46:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:46:17,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-11 20:46:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2067, Unknown=0, NotChecked=0, Total=2256 [2022-12-11 20:46:17,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 256 [2022-12-11 20:46:17,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 1430 transitions, 23402 flow. Second operand has 48 states, 48 states have (on average 114.27083333333333) internal successors, (5485), 48 states have internal predecessors, (5485), 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) [2022-12-11 20:46:17,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:46:17,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 256 [2022-12-11 20:46:17,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:46:33,109 INFO L130 PetriNetUnfolder]: 8075/18699 cut-off events. [2022-12-11 20:46:33,109 INFO L131 PetriNetUnfolder]: For 195200/197119 co-relation queries the response was YES. [2022-12-11 20:46:33,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133104 conditions, 18699 events. 8075/18699 cut-off events. For 195200/197119 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 154328 event pairs, 1222 based on Foata normal form. 4/17522 useless extension candidates. Maximal degree in co-relation 126148. Up to 11253 conditions per place. [2022-12-11 20:46:33,214 INFO L137 encePairwiseOnDemand]: 198/256 looper letters, 1457 selfloop transitions, 151 changer transitions 37/1755 dead transitions. [2022-12-11 20:46:33,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 1755 transitions, 31722 flow [2022-12-11 20:46:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-11 20:46:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-11 20:46:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 7572 transitions. [2022-12-11 20:46:33,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4694940476190476 [2022-12-11 20:46:33,246 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 414 predicate places. [2022-12-11 20:46:33,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 651 places, 1755 transitions, 31722 flow [2022-12-11 20:46:33,331 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 651 places, 1718 transitions, 30780 flow [2022-12-11 20:46:33,331 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 1718 transitions, 30780 flow [2022-12-11 20:46:33,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 114.27083333333333) internal successors, (5485), 48 states have internal predecessors, (5485), 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) [2022-12-11 20:46:33,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:46:33,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:46:33,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 20:46:33,348 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:46:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:46:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash 60396980, now seen corresponding path program 5 times [2022-12-11 20:46:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:46:33,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489562876] [2022-12-11 20:46:33,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:46:33,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:46:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:46:38,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:46:38,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:46:38,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489562876] [2022-12-11 20:46:38,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489562876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:46:38,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:46:38,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-12-11 20:46:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116820464] [2022-12-11 20:46:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:46:38,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-11 20:46:38,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:46:38,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-11 20:46:38,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2053, Unknown=0, NotChecked=0, Total=2256 [2022-12-11 20:46:38,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 256 [2022-12-11 20:46:38,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 1718 transitions, 30780 flow. Second operand has 48 states, 48 states have (on average 114.27083333333333) internal successors, (5485), 48 states have internal predecessors, (5485), 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) [2022-12-11 20:46:38,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:46:38,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 256 [2022-12-11 20:46:38,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:46:57,158 INFO L130 PetriNetUnfolder]: 9704/22576 cut-off events. [2022-12-11 20:46:57,159 INFO L131 PetriNetUnfolder]: For 262171/265524 co-relation queries the response was YES. [2022-12-11 20:46:57,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175598 conditions, 22576 events. 9704/22576 cut-off events. For 262171/265524 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 194798 event pairs, 1056 based on Foata normal form. 7/21147 useless extension candidates. Maximal degree in co-relation 167332. Up to 13958 conditions per place. [2022-12-11 20:46:57,320 INFO L137 encePairwiseOnDemand]: 197/256 looper letters, 1779 selfloop transitions, 193 changer transitions 43/2125 dead transitions. [2022-12-11 20:46:57,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 2125 transitions, 42458 flow [2022-12-11 20:46:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-11 20:46:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-12-11 20:46:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 7407 transitions. [2022-12-11 20:46:57,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47432120901639346 [2022-12-11 20:46:57,333 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 474 predicate places. [2022-12-11 20:46:57,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 711 places, 2125 transitions, 42458 flow [2022-12-11 20:46:57,462 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 711 places, 2082 transitions, 41262 flow [2022-12-11 20:46:57,463 INFO L495 AbstractCegarLoop]: Abstraction has has 711 places, 2082 transitions, 41262 flow [2022-12-11 20:46:57,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 114.27083333333333) internal successors, (5485), 48 states have internal predecessors, (5485), 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) [2022-12-11 20:46:57,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:46:57,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:46:57,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 20:46:57,489 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:46:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:46:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash 407958452, now seen corresponding path program 6 times [2022-12-11 20:46:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:46:57,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143102991] [2022-12-11 20:46:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:46:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:46:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:47:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:47:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:47:04,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143102991] [2022-12-11 20:47:04,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143102991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:47:04,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:47:04,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-12-11 20:47:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11210031] [2022-12-11 20:47:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:47:04,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-11 20:47:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:47:04,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-11 20:47:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2022-12-11 20:47:04,164 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 256 [2022-12-11 20:47:04,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 2082 transitions, 41262 flow. Second operand has 45 states, 45 states have (on average 120.35555555555555) internal successors, (5416), 45 states have internal predecessors, (5416), 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) [2022-12-11 20:47:04,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:47:04,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 256 [2022-12-11 20:47:04,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:47:23,689 INFO L130 PetriNetUnfolder]: 10922/25202 cut-off events. [2022-12-11 20:47:23,690 INFO L131 PetriNetUnfolder]: For 329083/333512 co-relation queries the response was YES. [2022-12-11 20:47:23,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215271 conditions, 25202 events. 10922/25202 cut-off events. For 329083/333512 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 221912 event pairs, 1018 based on Foata normal form. 99/23786 useless extension candidates. Maximal degree in co-relation 205592. Up to 15988 conditions per place. [2022-12-11 20:47:23,881 INFO L137 encePairwiseOnDemand]: 202/256 looper letters, 1963 selfloop transitions, 344 changer transitions 24/2460 dead transitions. [2022-12-11 20:47:23,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 777 places, 2460 transitions, 53477 flow [2022-12-11 20:47:23,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-11 20:47:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2022-12-11 20:47:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 8535 transitions. [2022-12-11 20:47:23,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4976096082089552 [2022-12-11 20:47:23,886 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 540 predicate places. [2022-12-11 20:47:23,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 777 places, 2460 transitions, 53477 flow [2022-12-11 20:47:24,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 777 places, 2436 transitions, 52601 flow [2022-12-11 20:47:24,029 INFO L495 AbstractCegarLoop]: Abstraction has has 777 places, 2436 transitions, 52601 flow [2022-12-11 20:47:24,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 120.35555555555555) internal successors, (5416), 45 states have internal predecessors, (5416), 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) [2022-12-11 20:47:24,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:47:24,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:47:24,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 20:47:24,030 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:47:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:47:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 732628784, now seen corresponding path program 7 times [2022-12-11 20:47:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:47:24,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977553713] [2022-12-11 20:47:24,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:47:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:47:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-11 20:58:04,309 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 20:58:04,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-11 20:58:04,391 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-11 20:58:04,394 INFO L158 Benchmark]: Toolchain (without parser) took 805553.22ms. Allocated memory was 183.5MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 158.0MB in the beginning and 708.5MB in the end (delta: -550.6MB). Peak memory consumption was 4.9GB. Max. memory is 8.0GB. [2022-12-11 20:58:04,394 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 20:58:04,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.77ms. Allocated memory is still 183.5MB. Free memory was 158.0MB in the beginning and 127.8MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-11 20:58:04,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.89ms. Allocated memory is still 183.5MB. Free memory was 127.8MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 20:58:04,395 INFO L158 Benchmark]: Boogie Preprocessor took 38.17ms. Allocated memory is still 183.5MB. Free memory was 124.7MB in the beginning and 122.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:58:04,395 INFO L158 Benchmark]: RCFGBuilder took 476.37ms. Allocated memory is still 183.5MB. Free memory was 122.6MB in the beginning and 99.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-11 20:58:04,395 INFO L158 Benchmark]: TraceAbstraction took 804508.48ms. Allocated memory was 183.5MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 98.0MB in the beginning and 708.5MB in the end (delta: -610.6MB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. [2022-12-11 20:58:04,396 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory is still 159.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.77ms. Allocated memory is still 183.5MB. Free memory was 158.0MB in the beginning and 127.8MB in the end (delta: 30.1MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.89ms. Allocated memory is still 183.5MB. Free memory was 127.8MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.17ms. Allocated memory is still 183.5MB. Free memory was 124.7MB in the beginning and 122.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 476.37ms. Allocated memory is still 183.5MB. Free memory was 122.6MB in the beginning and 99.3MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 804508.48ms. Allocated memory was 183.5MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 98.0MB in the beginning and 708.5MB in the end (delta: -610.6MB). Peak memory consumption was 4.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown