/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/weaver/chl-array-int-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 21:20:18,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 21:20:18,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 21:20:18,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 21:20:18,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 21:20:18,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 21:20:18,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 21:20:18,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 21:20:18,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 21:20:18,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 21:20:18,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 21:20:18,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 21:20:18,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 21:20:18,328 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 21:20:18,329 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 21:20:18,330 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 21:20:18,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 21:20:18,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 21:20:18,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 21:20:18,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 21:20:18,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 21:20:18,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 21:20:18,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 21:20:18,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 21:20:18,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 21:20:18,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 21:20:18,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 21:20:18,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 21:20:18,339 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 21:20:18,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 21:20:18,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 21:20:18,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 21:20:18,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 21:20:18,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 21:20:18,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 21:20:18,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 21:20:18,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 21:20:18,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 21:20:18,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 21:20:18,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 21:20:18,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 21:20:18,344 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 21:20:18,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 21:20:18,368 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 21:20:18,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 21:20:18,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 21:20:18,370 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 21:20:18,370 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 21:20:18,371 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 21:20:18,371 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 21:20:18,371 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 21:20:18,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 21:20:18,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 21:20:18,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 21:20:18,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:20:18,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 21:20:18,373 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 21:20:18,374 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 21:20:18,374 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 21:20:18,374 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 21:20:18,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 21:20:18,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 21:20:18,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 21:20:18,646 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 21:20:18,647 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 21:20:18,648 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-11 21:20:19,572 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 21:20:19,759 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 21:20:19,759 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c [2022-12-11 21:20:19,764 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ed7cd7f/36ae8308041f4336880d867f6327c589/FLAGbd57dca7a [2022-12-11 21:20:20,150 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ed7cd7f/36ae8308041f4336880d867f6327c589 [2022-12-11 21:20:20,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 21:20:20,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 21:20:20,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 21:20:20,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 21:20:20,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 21:20:20,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8b4572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20, skipping insertion in model container [2022-12-11 21:20:20,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 21:20:20,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 21:20:20,341 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2781,2794] [2022-12-11 21:20:20,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:20:20,356 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 21:20:20,388 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-subst.wvr.c[2781,2794] [2022-12-11 21:20:20,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 21:20:20,402 INFO L208 MainTranslator]: Completed translation [2022-12-11 21:20:20,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20 WrapperNode [2022-12-11 21:20:20,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 21:20:20,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 21:20:20,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 21:20:20,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 21:20:20,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,459 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 281 [2022-12-11 21:20:20,460 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 21:20:20,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 21:20:20,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 21:20:20,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 21:20:20,467 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,494 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 21:20:20,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 21:20:20,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 21:20:20,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 21:20:20,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (1/1) ... [2022-12-11 21:20:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 21:20:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:20:20,525 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 21:20:20,558 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 21:20:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 21:20:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 21:20:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 21:20:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 21:20:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 21:20:20,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 21:20:20,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 21:20:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 21:20:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 21:20:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 21:20:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 21:20:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 21:20:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 21:20:20,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 21:20:20,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 21:20:20,573 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 21:20:20,680 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 21:20:20,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 21:20:21,063 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 21:20:21,071 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 21:20:21,071 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-11 21:20:21,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:20:21 BoogieIcfgContainer [2022-12-11 21:20:21,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 21:20:21,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 21:20:21,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 21:20:21,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 21:20:21,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 09:20:20" (1/3) ... [2022-12-11 21:20:21,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c153059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:20:21, skipping insertion in model container [2022-12-11 21:20:21,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 09:20:20" (2/3) ... [2022-12-11 21:20:21,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c153059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 09:20:21, skipping insertion in model container [2022-12-11 21:20:21,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 09:20:21" (3/3) ... [2022-12-11 21:20:21,083 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2022-12-11 21:20:21,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 21:20:21,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 21:20:21,097 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 21:20:21,184 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 21:20:21,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 299 places, 318 transitions, 660 flow [2022-12-11 21:20:21,277 INFO L130 PetriNetUnfolder]: 29/315 cut-off events. [2022-12-11 21:20:21,277 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 21:20:21,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 315 events. 29/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 510 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 239. Up to 3 conditions per place. [2022-12-11 21:20:21,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 299 places, 318 transitions, 660 flow [2022-12-11 21:20:21,287 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 305 transitions, 628 flow [2022-12-11 21:20:21,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 21:20:21,297 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;@519bd669, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 21:20:21,297 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 21:20:21,339 INFO L130 PetriNetUnfolder]: 29/304 cut-off events. [2022-12-11 21:20:21,339 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 21:20:21,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:20:21,340 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] [2022-12-11 21:20:21,340 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 1 more)] === [2022-12-11 21:20:21,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:20:21,344 INFO L85 PathProgramCache]: Analyzing trace with hash -801687797, now seen corresponding path program 1 times [2022-12-11 21:20:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:20:21,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842912440] [2022-12-11 21:20:21,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:20:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:20:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:20:23,348 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 21:20:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:20:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842912440] [2022-12-11 21:20:23,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842912440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:20:23,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:20:23,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-11 21:20:23,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679465063] [2022-12-11 21:20:23,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:20:23,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-11 21:20:23,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:20:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-11 21:20:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-12-11 21:20:23,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 318 [2022-12-11 21:20:23,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 305 transitions, 628 flow. Second operand has 28 states, 28 states have (on average 202.53571428571428) internal successors, (5671), 28 states have internal predecessors, (5671), 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 21:20:23,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:20:23,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 318 [2022-12-11 21:20:23,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:20:27,690 INFO L130 PetriNetUnfolder]: 1404/9226 cut-off events. [2022-12-11 21:20:27,690 INFO L131 PetriNetUnfolder]: For 600/624 co-relation queries the response was YES. [2022-12-11 21:20:27,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11523 conditions, 9226 events. 1404/9226 cut-off events. For 600/624 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 107388 event pairs, 706 based on Foata normal form. 551/8552 useless extension candidates. Maximal degree in co-relation 3801. Up to 500 conditions per place. [2022-12-11 21:20:27,787 INFO L137 encePairwiseOnDemand]: 252/318 looper letters, 209 selfloop transitions, 39 changer transitions 30/466 dead transitions. [2022-12-11 21:20:27,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 466 transitions, 1578 flow [2022-12-11 21:20:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-11 21:20:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-11 21:20:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 9160 transitions. [2022-12-11 21:20:27,813 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6546598056032018 [2022-12-11 21:20:27,816 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 43 predicate places. [2022-12-11 21:20:27,816 INFO L82 GeneralOperation]: Start removeDead. Operand has 329 places, 466 transitions, 1578 flow [2022-12-11 21:20:27,841 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 436 transitions, 1455 flow [2022-12-11 21:20:27,842 INFO L495 AbstractCegarLoop]: Abstraction has has 306 places, 436 transitions, 1455 flow [2022-12-11 21:20:27,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 202.53571428571428) internal successors, (5671), 28 states have internal predecessors, (5671), 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 21:20:27,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:20:27,846 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] [2022-12-11 21:20:27,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 21:20:27,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:20:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:20:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1677946439, now seen corresponding path program 2 times [2022-12-11 21:20:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:20:27,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894932650] [2022-12-11 21:20:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:20:27,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:20:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:20:29,068 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 21:20:29,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:20:29,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894932650] [2022-12-11 21:20:29,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894932650] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:20:29,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:20:29,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-11 21:20:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614129439] [2022-12-11 21:20:29,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:20:29,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-11 21:20:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:20:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-11 21:20:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2022-12-11 21:20:29,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 318 [2022-12-11 21:20:29,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 436 transitions, 1455 flow. Second operand has 28 states, 28 states have (on average 202.53571428571428) internal successors, (5671), 28 states have internal predecessors, (5671), 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 21:20:29,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:20:29,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 318 [2022-12-11 21:20:29,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:20:33,710 INFO L130 PetriNetUnfolder]: 2204/14378 cut-off events. [2022-12-11 21:20:33,710 INFO L131 PetriNetUnfolder]: For 2263/6278 co-relation queries the response was YES. [2022-12-11 21:20:33,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21077 conditions, 14378 events. 2204/14378 cut-off events. For 2263/6278 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 181225 event pairs, 819 based on Foata normal form. 50/12464 useless extension candidates. Maximal degree in co-relation 7521. Up to 1328 conditions per place. [2022-12-11 21:20:33,780 INFO L137 encePairwiseOnDemand]: 279/318 looper letters, 323 selfloop transitions, 57 changer transitions 16/584 dead transitions. [2022-12-11 21:20:33,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 584 transitions, 2908 flow [2022-12-11 21:20:33,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-11 21:20:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-11 21:20:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 9765 transitions. [2022-12-11 21:20:33,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6533520674427941 [2022-12-11 21:20:33,796 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 66 predicate places. [2022-12-11 21:20:33,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 352 places, 584 transitions, 2908 flow [2022-12-11 21:20:33,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 568 transitions, 2806 flow [2022-12-11 21:20:33,829 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 568 transitions, 2806 flow [2022-12-11 21:20:33,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 202.53571428571428) internal successors, (5671), 28 states have internal predecessors, (5671), 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 21:20:33,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:20:33,832 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] [2022-12-11 21:20:33,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 21:20:33,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:20:33,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:20:33,833 INFO L85 PathProgramCache]: Analyzing trace with hash 138549191, now seen corresponding path program 3 times [2022-12-11 21:20:33,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:20:33,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438016801] [2022-12-11 21:20:33,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:20:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:20:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:20:35,049 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 21:20:35,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:20:35,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438016801] [2022-12-11 21:20:35,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438016801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:20:35,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:20:35,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-12-11 21:20:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381358906] [2022-12-11 21:20:35,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:20:35,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-11 21:20:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:20:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-11 21:20:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2022-12-11 21:20:35,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 318 [2022-12-11 21:20:35,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 568 transitions, 2806 flow. Second operand has 24 states, 24 states have (on average 202.95833333333334) internal successors, (4871), 24 states have internal predecessors, (4871), 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 21:20:35,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:20:35,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 318 [2022-12-11 21:20:35,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:20:38,867 INFO L130 PetriNetUnfolder]: 2325/15199 cut-off events. [2022-12-11 21:20:38,867 INFO L131 PetriNetUnfolder]: For 5018/16177 co-relation queries the response was YES. [2022-12-11 21:20:38,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25658 conditions, 15199 events. 2325/15199 cut-off events. For 5018/16177 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 194188 event pairs, 782 based on Foata normal form. 68/13172 useless extension candidates. Maximal degree in co-relation 9906. Up to 1328 conditions per place. [2022-12-11 21:20:38,952 INFO L137 encePairwiseOnDemand]: 285/318 looper letters, 411 selfloop transitions, 49 changer transitions 8/656 dead transitions. [2022-12-11 21:20:38,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 656 transitions, 4315 flow [2022-12-11 21:20:38,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-11 21:20:38,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-11 21:20:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 6047 transitions. [2022-12-11 21:20:38,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6557145955324225 [2022-12-11 21:20:38,961 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 84 predicate places. [2022-12-11 21:20:38,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 370 places, 656 transitions, 4315 flow [2022-12-11 21:20:39,003 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 365 places, 648 transitions, 4248 flow [2022-12-11 21:20:39,003 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 648 transitions, 4248 flow [2022-12-11 21:20:39,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 202.95833333333334) internal successors, (4871), 24 states have internal predecessors, (4871), 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 21:20:39,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:20:39,005 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] [2022-12-11 21:20:39,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 21:20:39,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:20:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:20:39,006 INFO L85 PathProgramCache]: Analyzing trace with hash 122580099, now seen corresponding path program 4 times [2022-12-11 21:20:39,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:20:39,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637948287] [2022-12-11 21:20:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:20:39,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:20:39,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:20:40,552 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 21:20:40,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:20:40,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637948287] [2022-12-11 21:20:40,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637948287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:20:40,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:20:40,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-12-11 21:20:40,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985907566] [2022-12-11 21:20:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:20:40,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-11 21:20:40,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:20:40,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-11 21:20:40,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2022-12-11 21:20:40,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 318 [2022-12-11 21:20:40,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 648 transitions, 4248 flow. Second operand has 30 states, 30 states have (on average 199.46666666666667) internal successors, (5984), 30 states have internal predecessors, (5984), 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 21:20:40,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:20:40,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 318 [2022-12-11 21:20:40,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:20:48,174 INFO L130 PetriNetUnfolder]: 3519/22817 cut-off events. [2022-12-11 21:20:48,174 INFO L131 PetriNetUnfolder]: For 14194/50848 co-relation queries the response was YES. [2022-12-11 21:20:48,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44537 conditions, 22817 events. 3519/22817 cut-off events. For 14194/50848 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 315365 event pairs, 727 based on Foata normal form. 246/19901 useless extension candidates. Maximal degree in co-relation 9391. Up to 1714 conditions per place. [2022-12-11 21:20:48,308 INFO L137 encePairwiseOnDemand]: 280/318 looper letters, 786 selfloop transitions, 95 changer transitions 24/1090 dead transitions. [2022-12-11 21:20:48,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1090 transitions, 9858 flow [2022-12-11 21:20:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-12-11 21:20:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-12-11 21:20:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 11297 transitions. [2022-12-11 21:20:48,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6459119496855346 [2022-12-11 21:20:48,318 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 133 predicate places. [2022-12-11 21:20:48,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 419 places, 1090 transitions, 9858 flow [2022-12-11 21:20:48,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 404 places, 1066 transitions, 9609 flow [2022-12-11 21:20:48,386 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 1066 transitions, 9609 flow [2022-12-11 21:20:48,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 199.46666666666667) internal successors, (5984), 30 states have internal predecessors, (5984), 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 21:20:48,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:20:48,388 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] [2022-12-11 21:20:48,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 21:20:48,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:20:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:20:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash 679944219, now seen corresponding path program 5 times [2022-12-11 21:20:48,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:20:48,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768496334] [2022-12-11 21:20:48,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:20:48,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:20:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:20:49,514 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 21:20:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:20:49,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768496334] [2022-12-11 21:20:49,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768496334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:20:49,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:20:49,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-12-11 21:20:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977001377] [2022-12-11 21:20:49,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:20:49,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-11 21:20:49,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:20:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-11 21:20:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2022-12-11 21:20:49,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 318 [2022-12-11 21:20:49,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 1066 transitions, 9609 flow. Second operand has 26 states, 26 states have (on average 202.73076923076923) internal successors, (5271), 26 states have internal predecessors, (5271), 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 21:20:49,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:20:49,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 318 [2022-12-11 21:20:49,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:20:54,816 INFO L130 PetriNetUnfolder]: 3522/22998 cut-off events. [2022-12-11 21:20:54,816 INFO L131 PetriNetUnfolder]: For 21334/65892 co-relation queries the response was YES. [2022-12-11 21:20:54,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49790 conditions, 22998 events. 3522/22998 cut-off events. For 21334/65892 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 317642 event pairs, 714 based on Foata normal form. 142/19953 useless extension candidates. Maximal degree in co-relation 10476. Up to 1706 conditions per place. [2022-12-11 21:20:55,053 INFO L137 encePairwiseOnDemand]: 276/318 looper letters, 804 selfloop transitions, 65 changer transitions 8/1065 dead transitions. [2022-12-11 21:20:55,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1065 transitions, 11353 flow [2022-12-11 21:20:55,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-11 21:20:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-11 21:20:55,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 8928 transitions. [2022-12-11 21:20:55,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.652917946467749 [2022-12-11 21:20:55,062 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 160 predicate places. [2022-12-11 21:20:55,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 446 places, 1065 transitions, 11353 flow [2022-12-11 21:20:55,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 441 places, 1057 transitions, 11254 flow [2022-12-11 21:20:55,135 INFO L495 AbstractCegarLoop]: Abstraction has has 441 places, 1057 transitions, 11254 flow [2022-12-11 21:20:55,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 202.73076923076923) internal successors, (5271), 26 states have internal predecessors, (5271), 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 21:20:55,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:20:55,142 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] [2022-12-11 21:20:55,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 21:20:55,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:20:55,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:20:55,143 INFO L85 PathProgramCache]: Analyzing trace with hash -311427913, now seen corresponding path program 6 times [2022-12-11 21:20:55,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:20:55,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843913329] [2022-12-11 21:20:55,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:20:55,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:20:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:20:56,091 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 21:20:56,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:20:56,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843913329] [2022-12-11 21:20:56,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843913329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:20:56,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:20:56,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-12-11 21:20:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226506385] [2022-12-11 21:20:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:20:56,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-11 21:20:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:20:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-11 21:20:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2022-12-11 21:20:56,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 318 [2022-12-11 21:20:56,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 1057 transitions, 11254 flow. Second operand has 28 states, 28 states have (on average 202.53571428571428) internal successors, (5671), 28 states have internal predecessors, (5671), 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 21:20:56,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:20:56,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 318 [2022-12-11 21:20:56,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:00,959 INFO L130 PetriNetUnfolder]: 3525/22984 cut-off events. [2022-12-11 21:21:00,959 INFO L131 PetriNetUnfolder]: For 31047/96918 co-relation queries the response was YES. [2022-12-11 21:21:01,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54896 conditions, 22984 events. 3525/22984 cut-off events. For 31047/96918 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 317579 event pairs, 734 based on Foata normal form. 111/19907 useless extension candidates. Maximal degree in co-relation 13485. Up to 1706 conditions per place. [2022-12-11 21:21:01,152 INFO L137 encePairwiseOnDemand]: 276/318 looper letters, 795 selfloop transitions, 65 changer transitions 8/1056 dead transitions. [2022-12-11 21:21:01,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 1056 transitions, 12978 flow [2022-12-11 21:21:01,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-11 21:21:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-12-11 21:21:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 8927 transitions. [2022-12-11 21:21:01,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6528448149773293 [2022-12-11 21:21:01,184 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 197 predicate places. [2022-12-11 21:21:01,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 483 places, 1056 transitions, 12978 flow [2022-12-11 21:21:01,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 478 places, 1048 transitions, 12863 flow [2022-12-11 21:21:01,255 INFO L495 AbstractCegarLoop]: Abstraction has has 478 places, 1048 transitions, 12863 flow [2022-12-11 21:21:01,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 202.53571428571428) internal successors, (5671), 28 states have internal predecessors, (5671), 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 21:21:01,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:01,257 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] [2022-12-11 21:21:01,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 21:21:01,257 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1860622227, now seen corresponding path program 1 times [2022-12-11 21:21:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:01,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942309448] [2022-12-11 21:21:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:01,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:01,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942309448] [2022-12-11 21:21:01,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942309448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:01,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372717270] [2022-12-11 21:21:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:01,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:01,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:01,503 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:01,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-11 21:21:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:01,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-11 21:21:01,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:01,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:21:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:02,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372717270] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:02,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 21:21:02,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 26 [2022-12-11 21:21:02,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752430447] [2022-12-11 21:21:02,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:21:02,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:21:02,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:21:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-12-11 21:21:02,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 318 [2022-12-11 21:21:02,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1048 transitions, 12863 flow. Second operand has 13 states, 13 states have (on average 211.46153846153845) internal successors, (2749), 13 states have internal predecessors, (2749), 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 21:21:02,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:02,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 318 [2022-12-11 21:21:02,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:05,188 INFO L130 PetriNetUnfolder]: 3518/22843 cut-off events. [2022-12-11 21:21:05,189 INFO L131 PetriNetUnfolder]: For 37338/111324 co-relation queries the response was YES. [2022-12-11 21:21:05,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58623 conditions, 22843 events. 3518/22843 cut-off events. For 37338/111324 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 315035 event pairs, 694 based on Foata normal form. 46/19708 useless extension candidates. Maximal degree in co-relation 14665. Up to 1681 conditions per place. [2022-12-11 21:21:05,439 INFO L137 encePairwiseOnDemand]: 293/318 looper letters, 628 selfloop transitions, 53 changer transitions 52/988 dead transitions. [2022-12-11 21:21:05,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 988 transitions, 13489 flow [2022-12-11 21:21:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 21:21:05,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 21:21:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4324 transitions. [2022-12-11 21:21:05,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.679874213836478 [2022-12-11 21:21:05,443 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 211 predicate places. [2022-12-11 21:21:05,443 INFO L82 GeneralOperation]: Start removeDead. Operand has 497 places, 988 transitions, 13489 flow [2022-12-11 21:21:05,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 495 places, 936 transitions, 12609 flow [2022-12-11 21:21:05,512 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 936 transitions, 12609 flow [2022-12-11 21:21:05,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 211.46153846153845) internal successors, (2749), 13 states have internal predecessors, (2749), 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 21:21:05,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:05,512 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] [2022-12-11 21:21:05,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-11 21:21:05,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:05,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:05,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1000793448, now seen corresponding path program 1 times [2022-12-11 21:21:05,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:05,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247639130] [2022-12-11 21:21:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:05,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:05,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247639130] [2022-12-11 21:21:05,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247639130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:05,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245883254] [2022-12-11 21:21:05,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:05,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:05,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:05,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:05,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-11 21:21:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:06,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-11 21:21:06,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:06,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:21:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:06,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245883254] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:06,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 21:21:06,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 26 [2022-12-11 21:21:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985749178] [2022-12-11 21:21:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:21:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-11 21:21:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:06,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-11 21:21:06,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2022-12-11 21:21:06,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 318 [2022-12-11 21:21:06,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 936 transitions, 12609 flow. Second operand has 13 states, 13 states have (on average 211.46153846153845) internal successors, (2749), 13 states have internal predecessors, (2749), 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 21:21:06,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:06,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 318 [2022-12-11 21:21:06,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:10,044 INFO L130 PetriNetUnfolder]: 3925/25418 cut-off events. [2022-12-11 21:21:10,044 INFO L131 PetriNetUnfolder]: For 50014/148481 co-relation queries the response was YES. [2022-12-11 21:21:10,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69347 conditions, 25418 events. 3925/25418 cut-off events. For 50014/148481 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 356392 event pairs, 938 based on Foata normal form. 23/21919 useless extension candidates. Maximal degree in co-relation 15698. Up to 3695 conditions per place. [2022-12-11 21:21:10,317 INFO L137 encePairwiseOnDemand]: 296/318 looper letters, 692 selfloop transitions, 41 changer transitions 6/994 dead transitions. [2022-12-11 21:21:10,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 994 transitions, 15048 flow [2022-12-11 21:21:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 21:21:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 21:21:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3912 transitions. [2022-12-11 21:21:10,320 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6834381551362684 [2022-12-11 21:21:10,320 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 226 predicate places. [2022-12-11 21:21:10,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 512 places, 994 transitions, 15048 flow [2022-12-11 21:21:10,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 510 places, 988 transitions, 14931 flow [2022-12-11 21:21:10,400 INFO L495 AbstractCegarLoop]: Abstraction has has 510 places, 988 transitions, 14931 flow [2022-12-11 21:21:10,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 211.46153846153845) internal successors, (2749), 13 states have internal predecessors, (2749), 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 21:21:10,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:10,401 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] [2022-12-11 21:21:10,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-11 21:21:10,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-11 21:21:10,606 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 151811270, now seen corresponding path program 1 times [2022-12-11 21:21:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:10,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942445973] [2022-12-11 21:21:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:10,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942445973] [2022-12-11 21:21:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942445973] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728921493] [2022-12-11 21:21:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:11,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:11,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:11,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 21:21:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:11,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-11 21:21:11,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:11,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:21:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:12,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728921493] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:12,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 21:21:12,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19, 18] total 36 [2022-12-11 21:21:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786420173] [2022-12-11 21:21:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:21:12,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 21:21:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 21:21:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2022-12-11 21:21:12,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 318 [2022-12-11 21:21:12,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 988 transitions, 14931 flow. Second operand has 18 states, 18 states have (on average 206.11111111111111) internal successors, (3710), 18 states have internal predecessors, (3710), 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 21:21:12,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:12,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 318 [2022-12-11 21:21:12,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:15,999 INFO L130 PetriNetUnfolder]: 3963/25771 cut-off events. [2022-12-11 21:21:16,000 INFO L131 PetriNetUnfolder]: For 63287/181341 co-relation queries the response was YES. [2022-12-11 21:21:16,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75734 conditions, 25771 events. 3963/25771 cut-off events. For 63287/181341 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 362682 event pairs, 810 based on Foata normal form. 25/22185 useless extension candidates. Maximal degree in co-relation 16906. Up to 3834 conditions per place. [2022-12-11 21:21:16,197 INFO L137 encePairwiseOnDemand]: 288/318 looper letters, 741 selfloop transitions, 54 changer transitions 9/1025 dead transitions. [2022-12-11 21:21:16,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 1025 transitions, 17211 flow [2022-12-11 21:21:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-11 21:21:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-11 21:21:16,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6320 transitions. [2022-12-11 21:21:16,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6624737945492662 [2022-12-11 21:21:16,203 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 253 predicate places. [2022-12-11 21:21:16,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 539 places, 1025 transitions, 17211 flow [2022-12-11 21:21:16,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 537 places, 1016 transitions, 17025 flow [2022-12-11 21:21:16,295 INFO L495 AbstractCegarLoop]: Abstraction has has 537 places, 1016 transitions, 17025 flow [2022-12-11 21:21:16,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 206.11111111111111) internal successors, (3710), 18 states have internal predecessors, (3710), 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 21:21:16,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:16,296 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] [2022-12-11 21:21:16,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 21:21:16,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:16,501 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:16,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1183521124, now seen corresponding path program 2 times [2022-12-11 21:21:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:16,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998385733] [2022-12-11 21:21:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:17,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998385733] [2022-12-11 21:21:17,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998385733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:17,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409540599] [2022-12-11 21:21:17,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 21:21:17,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:17,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:17,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:17,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 21:21:17,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 21:21:17,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:21:17,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-11 21:21:17,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 21:21:17,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 21:21:17,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409540599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:21:17,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 21:21:17,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 25 [2022-12-11 21:21:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730345584] [2022-12-11 21:21:17,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:21:17,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:21:17,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:17,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:21:17,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2022-12-11 21:21:17,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 318 [2022-12-11 21:21:17,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 1016 transitions, 17025 flow. Second operand has 10 states, 10 states have (on average 232.6) internal successors, (2326), 10 states have internal predecessors, (2326), 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 21:21:17,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:17,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 318 [2022-12-11 21:21:17,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:21,350 INFO L130 PetriNetUnfolder]: 4681/30550 cut-off events. [2022-12-11 21:21:21,350 INFO L131 PetriNetUnfolder]: For 98644/282905 co-relation queries the response was YES. [2022-12-11 21:21:21,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96844 conditions, 30550 events. 4681/30550 cut-off events. For 98644/282905 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 442090 event pairs, 494 based on Foata normal form. 281/26435 useless extension candidates. Maximal degree in co-relation 18108. Up to 4204 conditions per place. [2022-12-11 21:21:21,609 INFO L137 encePairwiseOnDemand]: 305/318 looper letters, 803 selfloop transitions, 94 changer transitions 16/1186 dead transitions. [2022-12-11 21:21:21,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 1186 transitions, 22271 flow [2022-12-11 21:21:21,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:21:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:21:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2622 transitions. [2022-12-11 21:21:21,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7495711835334476 [2022-12-11 21:21:21,612 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 261 predicate places. [2022-12-11 21:21:21,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 547 places, 1186 transitions, 22271 flow [2022-12-11 21:21:21,891 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 541 places, 1170 transitions, 21913 flow [2022-12-11 21:21:21,892 INFO L495 AbstractCegarLoop]: Abstraction has has 541 places, 1170 transitions, 21913 flow [2022-12-11 21:21:21,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 232.6) internal successors, (2326), 10 states have internal predecessors, (2326), 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 21:21:21,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:21,893 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] [2022-12-11 21:21:21,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 21:21:22,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:22,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:22,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1519270018, now seen corresponding path program 3 times [2022-12-11 21:21:22,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:22,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132836305] [2022-12-11 21:21:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:22,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:22,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132836305] [2022-12-11 21:21:22,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132836305] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:22,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757247277] [2022-12-11 21:21:22,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 21:21:22,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:22,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:22,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:22,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 21:21:22,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-11 21:21:22,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:21:22,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-11 21:21:22,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 21:21:22,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 21:21:22,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757247277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:21:22,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 21:21:22,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 25 [2022-12-11 21:21:22,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633922379] [2022-12-11 21:21:22,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:21:22,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:21:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:22,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:21:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2022-12-11 21:21:22,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 318 [2022-12-11 21:21:22,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 1170 transitions, 21913 flow. Second operand has 10 states, 10 states have (on average 232.6) internal successors, (2326), 10 states have internal predecessors, (2326), 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 21:21:22,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:22,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 318 [2022-12-11 21:21:22,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:27,586 INFO L130 PetriNetUnfolder]: 4912/32051 cut-off events. [2022-12-11 21:21:27,587 INFO L131 PetriNetUnfolder]: For 120834/245575 co-relation queries the response was YES. [2022-12-11 21:21:27,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109517 conditions, 32051 events. 4912/32051 cut-off events. For 120834/245575 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 469678 event pairs, 445 based on Foata normal form. 390/27868 useless extension candidates. Maximal degree in co-relation 16785. Up to 4345 conditions per place. [2022-12-11 21:21:27,948 INFO L137 encePairwiseOnDemand]: 305/318 looper letters, 980 selfloop transitions, 103 changer transitions 31/1387 dead transitions. [2022-12-11 21:21:27,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 1387 transitions, 28972 flow [2022-12-11 21:21:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:21:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:21:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2621 transitions. [2022-12-11 21:21:27,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7492853058890795 [2022-12-11 21:21:27,950 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 265 predicate places. [2022-12-11 21:21:27,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 551 places, 1387 transitions, 28972 flow [2022-12-11 21:21:28,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 545 places, 1356 transitions, 28183 flow [2022-12-11 21:21:28,080 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 1356 transitions, 28183 flow [2022-12-11 21:21:28,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 232.6) internal successors, (2326), 10 states have internal predecessors, (2326), 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 21:21:28,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:28,081 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] [2022-12-11 21:21:28,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-11 21:21:28,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-11 21:21:28,316 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1178234370, now seen corresponding path program 4 times [2022-12-11 21:21:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:28,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959590712] [2022-12-11 21:21:28,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:28,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959590712] [2022-12-11 21:21:28,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959590712] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:28,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34691885] [2022-12-11 21:21:28,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 21:21:28,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:28,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:28,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:28,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 21:21:28,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 21:21:28,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:21:28,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-11 21:21:28,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:29,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:29,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:21:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:29,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34691885] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:29,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 21:21:29,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19, 18] total 36 [2022-12-11 21:21:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9464359] [2022-12-11 21:21:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:21:29,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 21:21:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:29,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 21:21:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2022-12-11 21:21:29,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 318 [2022-12-11 21:21:29,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 1356 transitions, 28183 flow. Second operand has 18 states, 18 states have (on average 206.11111111111111) internal successors, (3710), 18 states have internal predecessors, (3710), 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 21:21:29,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:29,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 318 [2022-12-11 21:21:29,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:35,563 INFO L130 PetriNetUnfolder]: 4796/31437 cut-off events. [2022-12-11 21:21:35,563 INFO L131 PetriNetUnfolder]: For 131726/259459 co-relation queries the response was YES. [2022-12-11 21:21:35,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113873 conditions, 31437 events. 4796/31437 cut-off events. For 131726/259459 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 456755 event pairs, 365 based on Foata normal form. 82/26995 useless extension candidates. Maximal degree in co-relation 17225. Up to 4225 conditions per place. [2022-12-11 21:21:35,956 INFO L137 encePairwiseOnDemand]: 288/318 looper letters, 1030 selfloop transitions, 70 changer transitions 16/1354 dead transitions. [2022-12-11 21:21:35,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 1354 transitions, 30367 flow [2022-12-11 21:21:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-11 21:21:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-11 21:21:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6321 transitions. [2022-12-11 21:21:35,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6625786163522013 [2022-12-11 21:21:35,962 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 288 predicate places. [2022-12-11 21:21:35,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 574 places, 1354 transitions, 30367 flow [2022-12-11 21:21:36,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 572 places, 1338 transitions, 29945 flow [2022-12-11 21:21:36,112 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 1338 transitions, 29945 flow [2022-12-11 21:21:36,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 206.11111111111111) internal successors, (3710), 18 states have internal predecessors, (3710), 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 21:21:36,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:36,131 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] [2022-12-11 21:21:36,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-11 21:21:36,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:36,332 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:36,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash 285807392, now seen corresponding path program 1 times [2022-12-11 21:21:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:36,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303162164] [2022-12-11 21:21:36,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:36,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:36,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303162164] [2022-12-11 21:21:36,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303162164] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:36,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469079750] [2022-12-11 21:21:36,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:36,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:36,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:36,521 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:36,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 21:21:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:36,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-11 21:21:36,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:36,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:21:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:37,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469079750] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:37,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-11 21:21:37,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2022-12-11 21:21:37,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897967524] [2022-12-11 21:21:37,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:21:37,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 21:21:37,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:37,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 21:21:37,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-12-11 21:21:37,164 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 318 [2022-12-11 21:21:37,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 1338 transitions, 29945 flow. Second operand has 11 states, 11 states have (on average 239.45454545454547) internal successors, (2634), 11 states have internal predecessors, (2634), 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 21:21:37,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:37,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 318 [2022-12-11 21:21:37,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:21:46,258 INFO L130 PetriNetUnfolder]: 9970/54955 cut-off events. [2022-12-11 21:21:46,259 INFO L131 PetriNetUnfolder]: For 297196/511078 co-relation queries the response was YES. [2022-12-11 21:21:46,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208119 conditions, 54955 events. 9970/54955 cut-off events. For 297196/511078 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 868257 event pairs, 1857 based on Foata normal form. 46/47311 useless extension candidates. Maximal degree in co-relation 37797. Up to 7061 conditions per place. [2022-12-11 21:21:46,941 INFO L137 encePairwiseOnDemand]: 300/318 looper letters, 971 selfloop transitions, 81 changer transitions 1/1674 dead transitions. [2022-12-11 21:21:46,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 1674 transitions, 40589 flow [2022-12-11 21:21:46,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 21:21:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 21:21:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4643 transitions. [2022-12-11 21:21:46,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7684541542535585 [2022-12-11 21:21:46,944 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 304 predicate places. [2022-12-11 21:21:46,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 590 places, 1674 transitions, 40589 flow [2022-12-11 21:21:47,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 590 places, 1673 transitions, 40558 flow [2022-12-11 21:21:47,190 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 1673 transitions, 40558 flow [2022-12-11 21:21:47,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 239.45454545454547) internal successors, (2634), 11 states have internal predecessors, (2634), 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 21:21:47,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:21:47,190 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] [2022-12-11 21:21:47,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-11 21:21:47,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:47,395 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:21:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:21:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 896069189, now seen corresponding path program 1 times [2022-12-11 21:21:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:21:47,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987349046] [2022-12-11 21:21:47,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:47,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:21:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:47,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:21:47,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987349046] [2022-12-11 21:21:47,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987349046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:21:47,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646929648] [2022-12-11 21:21:47,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:21:47,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:21:47,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:21:47,862 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:21:47,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 21:21:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:21:47,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-11 21:21:47,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:21:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:48,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 21:21:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 21:21:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646929648] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 21:21:49,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 21:21:49,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 37 [2022-12-11 21:21:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959452697] [2022-12-11 21:21:49,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 21:21:49,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-11 21:21:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:21:49,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-11 21:21:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2022-12-11 21:21:49,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 318 [2022-12-11 21:21:49,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 1673 transitions, 40558 flow. Second operand has 37 states, 37 states have (on average 206.3783783783784) internal successors, (7636), 37 states have internal predecessors, (7636), 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 21:21:49,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:21:49,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 318 [2022-12-11 21:21:49,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:22:02,551 INFO L130 PetriNetUnfolder]: 13062/72419 cut-off events. [2022-12-11 21:22:02,551 INFO L131 PetriNetUnfolder]: For 469312/828528 co-relation queries the response was YES. [2022-12-11 21:22:03,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287266 conditions, 72419 events. 13062/72419 cut-off events. For 469312/828528 co-relation queries the response was YES. Maximal size of possible extension queue 2069. Compared 1182438 event pairs, 2470 based on Foata normal form. 108/62341 useless extension candidates. Maximal degree in co-relation 35541. Up to 8305 conditions per place. [2022-12-11 21:22:03,377 INFO L137 encePairwiseOnDemand]: 291/318 looper letters, 1755 selfloop transitions, 83 changer transitions 24/2114 dead transitions. [2022-12-11 21:22:03,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 2114 transitions, 56330 flow [2022-12-11 21:22:03,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-11 21:22:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-11 21:22:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 8177 transitions. [2022-12-11 21:22:03,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6593291404612159 [2022-12-11 21:22:03,382 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 342 predicate places. [2022-12-11 21:22:03,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 628 places, 2114 transitions, 56330 flow [2022-12-11 21:22:03,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 626 places, 2090 transitions, 55643 flow [2022-12-11 21:22:03,812 INFO L495 AbstractCegarLoop]: Abstraction has has 626 places, 2090 transitions, 55643 flow [2022-12-11 21:22:03,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 206.3783783783784) internal successors, (7636), 37 states have internal predecessors, (7636), 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 21:22:03,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:22:03,814 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] [2022-12-11 21:22:03,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-11 21:22:04,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-11 21:22:04,021 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:22:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:22:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1367208961, now seen corresponding path program 2 times [2022-12-11 21:22:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:22:04,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822903623] [2022-12-11 21:22:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:22:04,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:22:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:22:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 21:22:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:22:04,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822903623] [2022-12-11 21:22:04,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822903623] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 21:22:04,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668995478] [2022-12-11 21:22:04,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 21:22:04,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 21:22:04,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 21:22:04,475 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 21:22:04,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-11 21:22:04,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 21:22:04,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 21:22:04,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-11 21:22:04,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 21:22:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-11 21:22:04,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 21:22:04,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668995478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:22:04,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 21:22:04,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 26 [2022-12-11 21:22:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939362659] [2022-12-11 21:22:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:22:04,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 21:22:04,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:22:04,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 21:22:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2022-12-11 21:22:04,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 318 [2022-12-11 21:22:04,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 2090 transitions, 55643 flow. Second operand has 10 states, 10 states have (on average 232.7) internal successors, (2327), 10 states have internal predecessors, (2327), 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 21:22:04,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:22:04,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 318 [2022-12-11 21:22:04,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:22:19,416 INFO L130 PetriNetUnfolder]: 14003/76041 cut-off events. [2022-12-11 21:22:19,416 INFO L131 PetriNetUnfolder]: For 579593/1128768 co-relation queries the response was YES. [2022-12-11 21:22:20,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322759 conditions, 76041 events. 14003/76041 cut-off events. For 579593/1128768 co-relation queries the response was YES. Maximal size of possible extension queue 2117. Compared 1241626 event pairs, 2406 based on Foata normal form. 775/65933 useless extension candidates. Maximal degree in co-relation 42725. Up to 8626 conditions per place. [2022-12-11 21:22:20,651 INFO L137 encePairwiseOnDemand]: 305/318 looper letters, 1707 selfloop transitions, 219 changer transitions 16/2242 dead transitions. [2022-12-11 21:22:20,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 2242 transitions, 63934 flow [2022-12-11 21:22:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 21:22:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 21:22:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2620 transitions. [2022-12-11 21:22:20,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7489994282447112 [2022-12-11 21:22:20,655 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 350 predicate places. [2022-12-11 21:22:20,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 636 places, 2242 transitions, 63934 flow [2022-12-11 21:22:21,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 630 places, 2226 transitions, 63444 flow [2022-12-11 21:22:21,105 INFO L495 AbstractCegarLoop]: Abstraction has has 630 places, 2226 transitions, 63444 flow [2022-12-11 21:22:21,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 232.7) internal successors, (2327), 10 states have internal predecessors, (2327), 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 21:22:21,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:22:21,106 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] [2022-12-11 21:22:21,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-11 21:22:21,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-11 21:22:21,311 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:22:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:22:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 614559681, now seen corresponding path program 1 times [2022-12-11 21:22:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:22:21,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419853263] [2022-12-11 21:22:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:22:21,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:22:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:22:21,397 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 21:22:21,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:22:21,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419853263] [2022-12-11 21:22:21,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419853263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:22:21,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:22:21,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:22:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779114441] [2022-12-11 21:22:21,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:22:21,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:22:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:22:21,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:22:21,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:22:21,399 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 318 [2022-12-11 21:22:21,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 2226 transitions, 63444 flow. Second operand has 7 states, 7 states have (on average 245.85714285714286) internal successors, (1721), 7 states have internal predecessors, (1721), 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 21:22:21,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:22:21,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 318 [2022-12-11 21:22:21,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:22:34,346 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([841] L66-6-->L66-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][1371], [408#true, 8586#true, 4392#true, 37#L55-2true, 302#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, thread3Thread1of1ForFork2InUse, 1670#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~n1~0 1) ~n2~0)), 595#(<= 0 (+ ~n2~0 2147483648)), 209#L66-7true, 2877#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0))), 8034#true, 826#true, 4270#(= (+ ~res1~0 ~n2~0) ~n1~0), 39#L102-4true, 5577#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0))), 35#L78-3true, 8013#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (or (<= 1 ~n2~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 6900#(and (<= 1 ~n1~0) (or (<= 1 ~n2~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 3563#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0))), 724#true, 520#true]) [2022-12-11 21:22:34,346 INFO L382 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-12-11 21:22:34,346 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-11 21:22:34,346 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-11 21:22:34,346 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-11 21:22:34,346 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([841] L66-6-->L66-7: Formula: (= |v_thread2Thread1of1ForFork1_#t~ret11#1_5| v_~res2~0_2) InVars {thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_5|} OutVars{thread2Thread1of1ForFork1_#t~ret11#1=|v_thread2Thread1of1ForFork1_#t~ret11#1_5|, ~res2~0=v_~res2~0_2} AuxVars[] AssignedVars[~res2~0][1371], [408#true, 8586#true, 4392#true, 37#L55-2true, 302#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 1670#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~n1~0 1) ~n2~0)), 595#(<= 0 (+ ~n2~0 2147483648)), thread3Thread1of1ForFork2InUse, 209#L66-7true, 2877#(and (<= 1 ~n1~0) (<= (+ ~n2~0 1) ~n1~0) (not (= ~res1~0 0))), 8034#true, 826#true, 74#L79true, 4270#(= (+ ~res1~0 ~n2~0) ~n1~0), 5577#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0))), 39#L102-4true, 8013#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) ~n1~0) (<= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) (or (<= 1 ~n2~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 6900#(and (<= 1 ~n1~0) (or (<= 1 ~n2~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)))), 3563#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0))), 724#true, 520#true]) [2022-12-11 21:22:34,346 INFO L382 tUnfolder$Statistics]: this new event has 159 ancestors and is cut-off event [2022-12-11 21:22:34,346 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-11 21:22:34,347 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-11 21:22:34,347 INFO L385 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-12-11 21:22:39,769 INFO L130 PetriNetUnfolder]: 17193/88039 cut-off events. [2022-12-11 21:22:39,770 INFO L131 PetriNetUnfolder]: For 943668/1236725 co-relation queries the response was YES. [2022-12-11 21:22:40,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392785 conditions, 88039 events. 17193/88039 cut-off events. For 943668/1236725 co-relation queries the response was YES. Maximal size of possible extension queue 2440. Compared 1452518 event pairs, 4229 based on Foata normal form. 227/76114 useless extension candidates. Maximal degree in co-relation 71828. Up to 14011 conditions per place. [2022-12-11 21:22:40,913 INFO L137 encePairwiseOnDemand]: 307/318 looper letters, 901 selfloop transitions, 12 changer transitions 8/1974 dead transitions. [2022-12-11 21:22:40,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 1974 transitions, 57668 flow [2022-12-11 21:22:40,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 21:22:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 21:22:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2504 transitions. [2022-12-11 21:22:40,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7874213836477988 [2022-12-11 21:22:40,915 INFO L295 CegarLoopForPetriNet]: 286 programPoint places, 351 predicate places. [2022-12-11 21:22:40,915 INFO L82 GeneralOperation]: Start removeDead. Operand has 637 places, 1974 transitions, 57668 flow [2022-12-11 21:22:41,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 637 places, 1966 transitions, 57398 flow [2022-12-11 21:22:41,345 INFO L495 AbstractCegarLoop]: Abstraction has has 637 places, 1966 transitions, 57398 flow [2022-12-11 21:22:41,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 245.85714285714286) internal successors, (1721), 7 states have internal predecessors, (1721), 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 21:22:41,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 21:22:41,345 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] [2022-12-11 21:22:41,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 21:22:41,345 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 21:22:41,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 21:22:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1686239019, now seen corresponding path program 1 times [2022-12-11 21:22:41,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 21:22:41,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379150529] [2022-12-11 21:22:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 21:22:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 21:22:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 21:22:41,417 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 21:22:41,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 21:22:41,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379150529] [2022-12-11 21:22:41,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379150529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 21:22:41,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 21:22:41,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 21:22:41,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700735855] [2022-12-11 21:22:41,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 21:22:41,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 21:22:41,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 21:22:41,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 21:22:41,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-11 21:22:41,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 318 [2022-12-11 21:22:41,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 1966 transitions, 57398 flow. Second operand has 7 states, 7 states have (on average 245.85714285714286) internal successors, (1721), 7 states have internal predecessors, (1721), 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 21:22:41,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 21:22:41,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 318 [2022-12-11 21:22:41,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 21:22:49,916 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([895] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][1124], [1903#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 3849#(and (<= ~n1~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0)))), 7743#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n2~0))), 493#(and (or (<= (+ ~n1~0 1) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0)) (or (and (<= 0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~res1~0 1) 0) (and (<= ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0))) (<= ~n1~0 0) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0)))) (or (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0))), 8420#(= (+ ~res2~0 ~n3~0) ~n1~0), 4774#(= (+ ~res2~0 ~n3~0) ~n1~0), 5861#(and (<= ~n1~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0)))), thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0NotInUse, 905#(and (<= 0 ~n1~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), thread3Thread1of1ForFork2InUse, 8592#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2717#(or (<= 1 ~n1~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))), 667#(and (or (<= (+ ~n1~0 1) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0)) (or (and (<= 0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~n1~0 1) ~n2~0)) (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (or (and (<= 0 ~res2~0) (<= ~res2~0 0)) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0)))) (or (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0))), 268#L80-2true, 571#(and (<= ~n1~0 0) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)))) (or (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0))))), 801#(and (<= 0 ~n1~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 4376#(and (= (+ ~res1~0 ~n2~0) ~n1~0) (= (+ ~res2~0 ~n3~0) (+ ~res1~0 ~n2~0))), 377#(and (or (<= (+ ~n1~0 1) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0)) (or (<= 0 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)) (<= ~n1~0 0) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= ~n1~0 ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0)))) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))))), 144#L64-3true, 6660#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n2~0))), 8601#true, 256#L103-2true]) [2022-12-11 21:22:49,916 INFO L382 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-12-11 21:22:49,916 INFO L385 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-12-11 21:22:49,916 INFO L385 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-12-11 21:22:49,916 INFO L385 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-12-11 21:22:49,917 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([895] thread1EXIT-->L103-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][1124], [3849#(and (<= ~n1~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0)))), 7743#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n2~0))), 1903#(and (<= ~n1~0 0) (<= (+ ~n1~0 1) ~n2~0) (not (= ~res1~0 0))), 493#(and (or (<= (+ ~n1~0 1) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0)) (or (and (<= 0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~res1~0 1) 0) (and (<= ~n2~0 ~n3~0) (<= ~n3~0 ~n1~0))) (<= ~n1~0 0) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0)))) (or (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0))), 8420#(= (+ ~res2~0 ~n3~0) ~n1~0), 4774#(= (+ ~res2~0 ~n3~0) ~n1~0), 5861#(and (<= ~n1~0 0) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= (+ ~n2~0 1) ~n3~0) (<= (+ ~n1~0 1) ~n3~0)))), thread2Thread1of1ForFork1InUse, 157#L83-2true, thread1Thread1of1ForFork0NotInUse, 905#(and (<= 0 ~n1~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), thread3Thread1of1ForFork2InUse, 8592#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 667#(and (or (<= (+ ~n1~0 1) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0)) (or (and (<= 0 ~n2~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~n1~0 1) ~n2~0)) (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (or (and (<= 0 ~res2~0) (<= ~res2~0 0)) (<= (+ ~n1~0 1) ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0)))) (or (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0))), 2717#(or (<= 1 ~n1~0) (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|))), 571#(and (<= ~n1~0 0) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)) (or (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1) 0)))) (or (<= (+ ~n1~0 1) ~n2~0) (<= 0 ~n2~0)) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0))))), 801#(and (<= 0 ~n1~0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 4376#(and (= (+ ~res1~0 ~n2~0) ~n1~0) (= (+ ~res2~0 ~n3~0) (+ ~res1~0 ~n2~0))), 377#(and (or (<= (+ ~n1~0 1) ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n3~0)) (or (<= 0 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)) (<= ~n1~0 0) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= ~n1~0 ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0)))) (or (<= (+ ~n1~0 1) ~n2~0) (and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n3~0) (<= ~n3~0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0))))), 144#L64-3true, 8601#true, 6660#(or (not (< |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (and (<= 1 ~n1~0) (<= 1 ~n2~0))), 256#L103-2true]) [2022-12-11 21:22:49,917 INFO L382 tUnfolder$Statistics]: this new event has 148 ancestors and is cut-off event [2022-12-11 21:22:49,917 INFO L385 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-12-11 21:22:49,917 INFO L385 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-12-11 21:22:49,917 INFO L385 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event