/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 11:36:22,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 11:36:22,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 11:36:22,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 11:36:22,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 11:36:22,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 11:36:22,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 11:36:22,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 11:36:22,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 11:36:22,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 11:36:22,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 11:36:22,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 11:36:22,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 11:36:22,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 11:36:22,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 11:36:22,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 11:36:22,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 11:36:22,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 11:36:22,366 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 11:36:22,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 11:36:22,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 11:36:22,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 11:36:22,373 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 11:36:22,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 11:36:22,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 11:36:22,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 11:36:22,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 11:36:22,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 11:36:22,382 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 11:36:22,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 11:36:22,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 11:36:22,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 11:36:22,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 11:36:22,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 11:36:22,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 11:36:22,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 11:36:22,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 11:36:22,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 11:36:22,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 11:36:22,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 11:36:22,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 11:36:22,393 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-12 11:36:22,420 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 11:36:22,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 11:36:22,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 11:36:22,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 11:36:22,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 11:36:22,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 11:36:22,422 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 11:36:22,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 11:36:22,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 11:36:22,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 11:36:22,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 11:36:22,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 11:36:22,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 11:36:22,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 11:36:22,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 11:36:22,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 11:36:22,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 11:36:22,424 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 11:36:22,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 11:36:22,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 11:36:22,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 11:36:22,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 11:36:22,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 11:36:22,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:36:22,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 11:36:22,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 11:36:22,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 11:36:22,426 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 11:36:22,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 11:36:22,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 11:36:22,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 11:36:22,439 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 11:36:22,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 11:36:22,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 11:36:22,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 11:36:22,757 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 11:36:22,757 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 11:36:22,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-12 11:36:23,879 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 11:36:24,180 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 11:36:24,181 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-12-12 11:36:24,202 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e636ef397/df7d79d09572424597738b0d8885fbd6/FLAGb9253b32b [2022-12-12 11:36:24,212 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e636ef397/df7d79d09572424597738b0d8885fbd6 [2022-12-12 11:36:24,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 11:36:24,214 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 11:36:24,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 11:36:24,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 11:36:24,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 11:36:24,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1ea986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24, skipping insertion in model container [2022-12-12 11:36:24,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 11:36:24,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 11:36:24,648 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-12-12 11:36:24,656 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-12-12 11:36:24,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:36:24,670 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 11:36:24,718 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-12-12 11:36:24,720 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-12-12 11:36:24,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 11:36:24,778 INFO L208 MainTranslator]: Completed translation [2022-12-12 11:36:24,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24 WrapperNode [2022-12-12 11:36:24,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 11:36:24,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 11:36:24,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 11:36:24,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 11:36:24,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,858 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-12 11:36:24,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 11:36:24,859 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 11:36:24,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 11:36:24,859 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 11:36:24,866 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,892 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 11:36:24,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 11:36:24,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 11:36:24,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 11:36:24,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (1/1) ... [2022-12-12 11:36:24,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 11:36:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:36:24,924 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-12 11:36:24,949 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-12 11:36:24,963 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 11:36:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 11:36:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 11:36:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 11:36:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 11:36:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 11:36:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 11:36:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 11:36:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-12 11:36:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 11:36:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 11:36:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 11:36:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 11:36:24,968 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 11:36:25,172 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 11:36:25,173 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 11:36:25,479 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 11:36:25,486 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 11:36:25,486 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 11:36:25,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:36:25 BoogieIcfgContainer [2022-12-12 11:36:25,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 11:36:25,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 11:36:25,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 11:36:25,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 11:36:25,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 11:36:24" (1/3) ... [2022-12-12 11:36:25,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0f9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:36:25, skipping insertion in model container [2022-12-12 11:36:25,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 11:36:24" (2/3) ... [2022-12-12 11:36:25,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0f9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 11:36:25, skipping insertion in model container [2022-12-12 11:36:25,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 11:36:25" (3/3) ... [2022-12-12 11:36:25,496 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-12-12 11:36:25,510 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 11:36:25,511 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 11:36:25,511 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 11:36:25,593 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 11:36:25,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 215 transitions, 446 flow [2022-12-12 11:36:25,732 INFO L130 PetriNetUnfolder]: 13/213 cut-off events. [2022-12-12 11:36:25,732 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 11:36:25,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 13/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 357 event pairs, 0 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 140. Up to 3 conditions per place. [2022-12-12 11:36:25,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 215 transitions, 446 flow [2022-12-12 11:36:25,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 204 transitions, 417 flow [2022-12-12 11:36:25,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 11:36:25,773 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;@74ed161e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 11:36:25,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 11:36:25,800 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-12 11:36:25,801 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 11:36:25,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:25,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:36:25,802 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 2 more)] === [2022-12-12 11:36:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash 813813323, now seen corresponding path program 1 times [2022-12-12 11:36:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:25,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992341663] [2022-12-12 11:36:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:26,048 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-12 11:36:26,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:26,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992341663] [2022-12-12 11:36:26,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992341663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:36:26,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:36:26,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 11:36:26,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501683182] [2022-12-12 11:36:26,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:36:26,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 11:36:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:26,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 11:36:26,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 11:36:26,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 215 [2022-12-12 11:36:26,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 204 transitions, 417 flow. Second operand has 2 states, 2 states have (on average 204.5) internal successors, (409), 2 states have internal predecessors, (409), 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-12 11:36:26,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:26,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 215 [2022-12-12 11:36:26,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:26,178 INFO L130 PetriNetUnfolder]: 9/195 cut-off events. [2022-12-12 11:36:26,178 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-12 11:36:26,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 195 events. 9/195 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 275 event pairs, 0 based on Foata normal form. 5/190 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2022-12-12 11:36:26,186 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 3 selfloop transitions, 0 changer transitions 0/195 dead transitions. [2022-12-12 11:36:26,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 195 transitions, 405 flow [2022-12-12 11:36:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 11:36:26,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 11:36:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 415 transitions. [2022-12-12 11:36:26,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9651162790697675 [2022-12-12 11:36:26,209 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, -4 predicate places. [2022-12-12 11:36:26,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 195 transitions, 405 flow [2022-12-12 11:36:26,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 195 transitions, 394 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-12 11:36:26,217 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 195 transitions, 394 flow [2022-12-12 11:36:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 204.5) internal successors, (409), 2 states have internal predecessors, (409), 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-12 11:36:26,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:26,218 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] [2022-12-12 11:36:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 11:36:26,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1104887516, now seen corresponding path program 1 times [2022-12-12 11:36:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:26,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030880906] [2022-12-12 11:36:26,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:26,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:27,282 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-12 11:36:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:27,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030880906] [2022-12-12 11:36:27,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030880906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:36:27,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:36:27,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-12 11:36:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916009706] [2022-12-12 11:36:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:36:27,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-12 11:36:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-12 11:36:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-12 11:36:27,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 215 [2022-12-12 11:36:27,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 195 transitions, 394 flow. Second operand has 12 states, 12 states have (on average 153.25) internal successors, (1839), 12 states have internal predecessors, (1839), 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-12 11:36:27,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:27,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 215 [2022-12-12 11:36:27,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:28,023 INFO L130 PetriNetUnfolder]: 611/2461 cut-off events. [2022-12-12 11:36:28,023 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-12 11:36:28,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3392 conditions, 2461 events. 611/2461 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19474 event pairs, 459 based on Foata normal form. 0/2289 useless extension candidates. Maximal degree in co-relation 2402. Up to 882 conditions per place. [2022-12-12 11:36:28,039 INFO L137 encePairwiseOnDemand]: 202/215 looper letters, 42 selfloop transitions, 12 changer transitions 0/191 dead transitions. [2022-12-12 11:36:28,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 191 transitions, 494 flow [2022-12-12 11:36:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-12 11:36:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-12 11:36:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2005 transitions. [2022-12-12 11:36:28,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7173524150268337 [2022-12-12 11:36:28,049 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 1 predicate places. [2022-12-12 11:36:28,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 191 transitions, 494 flow [2022-12-12 11:36:28,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 191 transitions, 443 flow, removed 14 selfloop flow, removed 11 redundant places. [2022-12-12 11:36:28,060 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 191 transitions, 443 flow [2022-12-12 11:36:28,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 153.25) internal successors, (1839), 12 states have internal predecessors, (1839), 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-12 11:36:28,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:28,062 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] [2022-12-12 11:36:28,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 11:36:28,062 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:28,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:28,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1353821565, now seen corresponding path program 1 times [2022-12-12 11:36:28,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:28,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093966072] [2022-12-12 11:36:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:28,240 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-12 11:36:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:28,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093966072] [2022-12-12 11:36:28,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093966072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:36:28,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:36:28,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:36:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902980857] [2022-12-12 11:36:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:36:28,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:36:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:36:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:36:28,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 215 [2022-12-12 11:36:28,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 191 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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-12 11:36:28,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:28,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 215 [2022-12-12 11:36:28,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:28,336 INFO L130 PetriNetUnfolder]: 109/631 cut-off events. [2022-12-12 11:36:28,336 INFO L131 PetriNetUnfolder]: For 77/83 co-relation queries the response was YES. [2022-12-12 11:36:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 908 conditions, 631 events. 109/631 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3035 event pairs, 71 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 500. Up to 187 conditions per place. [2022-12-12 11:36:28,339 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 7 selfloop transitions, 2 changer transitions 5/194 dead transitions. [2022-12-12 11:36:28,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 194 transitions, 480 flow [2022-12-12 11:36:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:36:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:36:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-12-12 11:36:28,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9410852713178295 [2022-12-12 11:36:28,343 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, -8 predicate places. [2022-12-12 11:36:28,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 194 transitions, 480 flow [2022-12-12 11:36:28,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 194 transitions, 476 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-12 11:36:28,347 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 194 transitions, 476 flow [2022-12-12 11:36:28,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 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-12 11:36:28,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:28,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 11:36:28,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 11:36:28,348 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:28,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1703980672, now seen corresponding path program 1 times [2022-12-12 11:36:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:28,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642704982] [2022-12-12 11:36:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:28,429 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-12 11:36:28,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:28,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642704982] [2022-12-12 11:36:28,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642704982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:36:28,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:36:28,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:36:28,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616688314] [2022-12-12 11:36:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:36:28,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:36:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:36:28,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:36:28,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 215 [2022-12-12 11:36:28,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 194 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-12 11:36:28,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:28,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 215 [2022-12-12 11:36:28,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:28,583 INFO L130 PetriNetUnfolder]: 143/788 cut-off events. [2022-12-12 11:36:28,583 INFO L131 PetriNetUnfolder]: For 208/212 co-relation queries the response was YES. [2022-12-12 11:36:28,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1263 conditions, 788 events. 143/788 cut-off events. For 208/212 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3550 event pairs, 96 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 760. Up to 255 conditions per place. [2022-12-12 11:36:28,587 INFO L137 encePairwiseOnDemand]: 212/215 looper letters, 14 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2022-12-12 11:36:28,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 199 transitions, 528 flow [2022-12-12 11:36:28,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:36:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:36:28,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-12-12 11:36:28,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9410852713178295 [2022-12-12 11:36:28,591 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, -6 predicate places. [2022-12-12 11:36:28,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 199 transitions, 528 flow [2022-12-12 11:36:28,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 199 transitions, 522 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-12 11:36:28,595 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 199 transitions, 522 flow [2022-12-12 11:36:28,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 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-12 11:36:28,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:28,596 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] [2022-12-12 11:36:28,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 11:36:28,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:28,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1546322740, now seen corresponding path program 1 times [2022-12-12 11:36:28,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:28,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653013750] [2022-12-12 11:36:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:28,736 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-12 11:36:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653013750] [2022-12-12 11:36:28,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653013750] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:36:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340237035] [2022-12-12 11:36:28,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:28,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:28,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:36:28,743 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-12 11:36:28,767 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-12 11:36:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:28,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-12 11:36:28,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:36:29,023 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-12 11:36:29,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:36:29,096 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-12 11:36:29,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340237035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:36:29,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:36:29,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-12 11:36:29,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478161984] [2022-12-12 11:36:29,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:36:29,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 11:36:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:29,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 11:36:29,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-12 11:36:29,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-12 11:36:29,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 199 transitions, 522 flow. Second operand has 10 states, 10 states have (on average 198.2) internal successors, (1982), 10 states have internal predecessors, (1982), 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-12 11:36:29,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:29,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-12 11:36:29,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:29,304 INFO L130 PetriNetUnfolder]: 184/977 cut-off events. [2022-12-12 11:36:29,304 INFO L131 PetriNetUnfolder]: For 398/404 co-relation queries the response was YES. [2022-12-12 11:36:29,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 977 events. 184/977 cut-off events. For 398/404 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3775 event pairs, 105 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 924. Up to 332 conditions per place. [2022-12-12 11:36:29,310 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 21 selfloop transitions, 9 changer transitions 1/212 dead transitions. [2022-12-12 11:36:29,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 212 transitions, 670 flow [2022-12-12 11:36:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 11:36:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 11:36:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2022-12-12 11:36:29,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9276485788113695 [2022-12-12 11:36:29,316 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2022-12-12 11:36:29,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 212 transitions, 670 flow [2022-12-12 11:36:29,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 212 transitions, 614 flow, removed 26 selfloop flow, removed 2 redundant places. [2022-12-12 11:36:29,319 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 212 transitions, 614 flow [2022-12-12 11:36:29,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 198.2) internal successors, (1982), 10 states have internal predecessors, (1982), 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-12 11:36:29,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:29,321 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:36:29,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 11:36:29,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:29,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:29,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:29,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1221729524, now seen corresponding path program 2 times [2022-12-12 11:36:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:29,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836937229] [2022-12-12 11:36:29,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-12-12 11:36:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:29,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836937229] [2022-12-12 11:36:29,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836937229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:36:29,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 11:36:29,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 11:36:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784024437] [2022-12-12 11:36:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:36:29,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 11:36:29,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:29,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 11:36:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 11:36:29,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 215 [2022-12-12 11:36:29,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 212 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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-12 11:36:29,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:29,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 215 [2022-12-12 11:36:29,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:29,972 INFO L130 PetriNetUnfolder]: 233/1250 cut-off events. [2022-12-12 11:36:29,972 INFO L131 PetriNetUnfolder]: For 477/485 co-relation queries the response was YES. [2022-12-12 11:36:29,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 1250 events. 233/1250 cut-off events. For 477/485 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5592 event pairs, 120 based on Foata normal form. 2/1194 useless extension candidates. Maximal degree in co-relation 1331. Up to 431 conditions per place. [2022-12-12 11:36:29,978 INFO L137 encePairwiseOnDemand]: 211/215 looper letters, 21 selfloop transitions, 4 changer transitions 5/216 dead transitions. [2022-12-12 11:36:29,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 216 transitions, 702 flow [2022-12-12 11:36:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 11:36:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 11:36:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2022-12-12 11:36:29,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9255813953488372 [2022-12-12 11:36:29,983 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 2 predicate places. [2022-12-12 11:36:29,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 216 transitions, 702 flow [2022-12-12 11:36:29,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 216 transitions, 658 flow, removed 22 selfloop flow, removed 0 redundant places. [2022-12-12 11:36:29,987 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 216 transitions, 658 flow [2022-12-12 11:36:29,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 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-12 11:36:29,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:29,988 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:36:29,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 11:36:29,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:29,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1859606128, now seen corresponding path program 1 times [2022-12-12 11:36:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:29,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256354204] [2022-12-12 11:36:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:29,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256354204] [2022-12-12 11:36:30,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256354204] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:36:30,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079518683] [2022-12-12 11:36:30,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:30,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:36:30,283 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-12 11:36:30,285 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-12 11:36:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:30,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 11:36:30,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:36:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:30,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:36:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:30,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079518683] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:36:30,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:36:30,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-12 11:36:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942515138] [2022-12-12 11:36:30,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:36:30,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-12 11:36:30,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:30,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-12 11:36:30,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-12 11:36:30,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-12 11:36:30,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 216 transitions, 658 flow. Second operand has 18 states, 18 states have (on average 198.33333333333334) internal successors, (3570), 18 states have internal predecessors, (3570), 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-12 11:36:30,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:30,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-12 11:36:30,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:31,233 INFO L130 PetriNetUnfolder]: 433/2290 cut-off events. [2022-12-12 11:36:31,233 INFO L131 PetriNetUnfolder]: For 739/750 co-relation queries the response was YES. [2022-12-12 11:36:31,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 2290 events. 433/2290 cut-off events. For 739/750 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10844 event pairs, 240 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2480. Up to 847 conditions per place. [2022-12-12 11:36:31,242 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 48 selfloop transitions, 21 changer transitions 5/252 dead transitions. [2022-12-12 11:36:31,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 252 transitions, 1048 flow [2022-12-12 11:36:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-12 11:36:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-12 11:36:31,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4181 transitions. [2022-12-12 11:36:31,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9260243632336655 [2022-12-12 11:36:31,251 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 22 predicate places. [2022-12-12 11:36:31,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 252 transitions, 1048 flow [2022-12-12 11:36:31,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 252 transitions, 928 flow, removed 54 selfloop flow, removed 6 redundant places. [2022-12-12 11:36:31,256 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 252 transitions, 928 flow [2022-12-12 11:36:31,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 198.33333333333334) internal successors, (3570), 18 states have internal predecessors, (3570), 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-12 11:36:31,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:31,259 INFO L214 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:36:31,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-12 11:36:31,464 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,SelfDestructingSolverStorable6 [2022-12-12 11:36:31,465 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1583746706, now seen corresponding path program 2 times [2022-12-12 11:36:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:31,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646919349] [2022-12-12 11:36:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:32,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:32,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646919349] [2022-12-12 11:36:32,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646919349] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:36:32,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368208148] [2022-12-12 11:36:32,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 11:36:32,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:32,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:36:32,050 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-12 11:36:32,078 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-12 11:36:32,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 11:36:32,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:36:32,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-12 11:36:32,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:36:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:32,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:36:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:33,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368208148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:36:33,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:36:33,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-12-12 11:36:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378780445] [2022-12-12 11:36:33,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:36:33,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-12 11:36:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-12 11:36:33,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-12-12 11:36:33,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-12 11:36:33,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 252 transitions, 928 flow. Second operand has 34 states, 34 states have (on average 198.41176470588235) internal successors, (6746), 34 states have internal predecessors, (6746), 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-12 11:36:33,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:33,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-12 11:36:33,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:34,483 INFO L130 PetriNetUnfolder]: 833/4362 cut-off events. [2022-12-12 11:36:34,483 INFO L131 PetriNetUnfolder]: For 1772/1789 co-relation queries the response was YES. [2022-12-12 11:36:34,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8468 conditions, 4362 events. 833/4362 cut-off events. For 1772/1789 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 21388 event pairs, 483 based on Foata normal form. 48/4286 useless extension candidates. Maximal degree in co-relation 3450. Up to 1682 conditions per place. [2022-12-12 11:36:34,499 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 96 selfloop transitions, 45 changer transitions 10/324 dead transitions. [2022-12-12 11:36:34,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 324 transitions, 1806 flow [2022-12-12 11:36:34,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-12 11:36:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-12-12 11:36:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 8953 transitions. [2022-12-12 11:36:34,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.925374677002584 [2022-12-12 11:36:34,517 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 60 predicate places. [2022-12-12 11:36:34,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 324 transitions, 1806 flow [2022-12-12 11:36:34,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 324 transitions, 1542 flow, removed 114 selfloop flow, removed 18 redundant places. [2022-12-12 11:36:34,526 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 324 transitions, 1542 flow [2022-12-12 11:36:34,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 198.41176470588235) internal successors, (6746), 34 states have internal predecessors, (6746), 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-12 11:36:34,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:34,528 INFO L214 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:36:34,538 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-12 11:36:34,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:34,739 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash -586489244, now seen corresponding path program 3 times [2022-12-12 11:36:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:34,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975990310] [2022-12-12 11:36:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975990310] [2022-12-12 11:36:36,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975990310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:36:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350512730] [2022-12-12 11:36:36,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 11:36:36,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:36,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:36:36,500 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-12 11:36:36,563 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-12 11:36:36,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 11:36:36,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:36:36,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-12 11:36:36,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:36:39,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-12 11:36:39,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 11:36:39,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-12 11:36:39,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 11:36:39,363 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 11:36:39,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 11:36:39,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 11:36:39,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 11:36:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2022-12-12 11:36:39,515 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 11:36:39,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350512730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 11:36:39,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 11:36:39,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [33] total 44 [2022-12-12 11:36:39,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829016536] [2022-12-12 11:36:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 11:36:39,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-12 11:36:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-12 11:36:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2022-12-12 11:36:39,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 215 [2022-12-12 11:36:39,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 324 transitions, 1542 flow. Second operand has 13 states, 13 states have (on average 155.69230769230768) internal successors, (2024), 13 states have internal predecessors, (2024), 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-12 11:36:39,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:39,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 215 [2022-12-12 11:36:39,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:41,715 INFO L130 PetriNetUnfolder]: 2087/8507 cut-off events. [2022-12-12 11:36:41,716 INFO L131 PetriNetUnfolder]: For 6161/6198 co-relation queries the response was YES. [2022-12-12 11:36:41,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21527 conditions, 8507 events. 2087/8507 cut-off events. For 6161/6198 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 51903 event pairs, 25 based on Foata normal form. 0/8367 useless extension candidates. Maximal degree in co-relation 12060. Up to 3717 conditions per place. [2022-12-12 11:36:41,758 INFO L137 encePairwiseOnDemand]: 199/215 looper letters, 280 selfloop transitions, 20 changer transitions 8/499 dead transitions. [2022-12-12 11:36:41,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 499 transitions, 3656 flow [2022-12-12 11:36:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 11:36:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 11:36:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1904 transitions. [2022-12-12 11:36:41,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.737984496124031 [2022-12-12 11:36:41,836 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 53 predicate places. [2022-12-12 11:36:41,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 499 transitions, 3656 flow [2022-12-12 11:36:41,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 499 transitions, 3087 flow, removed 281 selfloop flow, removed 4 redundant places. [2022-12-12 11:36:41,861 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 499 transitions, 3087 flow [2022-12-12 11:36:41,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.69230769230768) internal successors, (2024), 13 states have internal predecessors, (2024), 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-12 11:36:41,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:41,862 INFO L214 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:36:41,872 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-12 11:36:42,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:42,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2040026037, now seen corresponding path program 1 times [2022-12-12 11:36:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:42,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358092089] [2022-12-12 11:36:42,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:43,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:43,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358092089] [2022-12-12 11:36:43,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358092089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:36:43,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227928744] [2022-12-12 11:36:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:43,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:43,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:36:43,588 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-12 11:36:43,590 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-12 11:36:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:43,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-12 11:36:43,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:36:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:44,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:36:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3032 backedges. 0 proven. 3032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:45,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227928744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:36:45,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:36:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-12-12 11:36:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231047597] [2022-12-12 11:36:45,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:36:45,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-12 11:36:45,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:36:45,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-12 11:36:45,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2022-12-12 11:36:45,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-12 11:36:45,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 499 transitions, 3087 flow. Second operand has 66 states, 66 states have (on average 198.45454545454547) internal successors, (13098), 66 states have internal predecessors, (13098), 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-12 11:36:45,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:36:45,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-12 11:36:45,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:36:52,119 INFO L130 PetriNetUnfolder]: 4231/16986 cut-off events. [2022-12-12 11:36:52,119 INFO L131 PetriNetUnfolder]: For 12404/12449 co-relation queries the response was YES. [2022-12-12 11:36:52,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39937 conditions, 16986 events. 4231/16986 cut-off events. For 12404/12449 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 103793 event pairs, 33 based on Foata normal form. 204/16954 useless extension candidates. Maximal degree in co-relation 23255. Up to 5444 conditions per place. [2022-12-12 11:36:52,185 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 470 selfloop transitions, 93 changer transitions 8/787 dead transitions. [2022-12-12 11:36:52,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 787 transitions, 7297 flow [2022-12-12 11:36:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-12-12 11:36:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2022-12-12 11:36:52,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 18497 transitions. [2022-12-12 11:36:52,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9250812703175794 [2022-12-12 11:36:52,212 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 141 predicate places. [2022-12-12 11:36:52,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 787 transitions, 7297 flow [2022-12-12 11:36:52,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 787 transitions, 6195 flow, removed 509 selfloop flow, removed 42 redundant places. [2022-12-12 11:36:52,304 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 787 transitions, 6195 flow [2022-12-12 11:36:52,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 198.45454545454547) internal successors, (13098), 66 states have internal predecessors, (13098), 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-12 11:36:52,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:36:52,321 INFO L214 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:36:52,330 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-12 11:36:52,527 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,SelfDestructingSolverStorable9 [2022-12-12 11:36:52,528 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:36:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:36:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1451245441, now seen corresponding path program 2 times [2022-12-12 11:36:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:36:52,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71138523] [2022-12-12 11:36:52,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:36:52,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:36:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:36:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:57,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:36:57,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71138523] [2022-12-12 11:36:57,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71138523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:36:57,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047480574] [2022-12-12 11:36:57,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 11:36:57,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:36:57,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:36:57,816 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-12 11:36:57,826 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-12 11:36:58,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 11:36:58,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:36:58,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 2299 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-12 11:36:58,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:36:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:36:59,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:37:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:02,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047480574] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:37:02,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:37:02,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2022-12-12 11:37:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851348585] [2022-12-12 11:37:02,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:37:02,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-12-12 11:37:02,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:37:02,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-12-12 11:37:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2022-12-12 11:37:02,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 215 [2022-12-12 11:37:02,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 787 transitions, 6195 flow. Second operand has 130 states, 130 states have (on average 198.47692307692307) internal successors, (25802), 130 states have internal predecessors, (25802), 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-12 11:37:02,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:37:02,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 215 [2022-12-12 11:37:02,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 11:37:25,987 INFO L130 PetriNetUnfolder]: 8519/33946 cut-off events. [2022-12-12 11:37:25,987 INFO L131 PetriNetUnfolder]: For 37012/37056 co-relation queries the response was YES. [2022-12-12 11:37:26,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84935 conditions, 33946 events. 8519/33946 cut-off events. For 37012/37056 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 208415 event pairs, 49 based on Foata normal form. 396/33914 useless extension candidates. Maximal degree in co-relation 50827. Up to 10980 conditions per place. [2022-12-12 11:37:26,111 INFO L137 encePairwiseOnDemand]: 209/215 looper letters, 950 selfloop transitions, 189 changer transitions 8/1363 dead transitions. [2022-12-12 11:37:26,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 1363 transitions, 15461 flow [2022-12-12 11:37:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2022-12-12 11:37:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2022-12-12 11:37:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 37585 transitions. [2022-12-12 11:37:26,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9249415528485296 [2022-12-12 11:37:26,151 INFO L295 CegarLoopForPetriNet]: 198 programPoint places, 287 predicate places. [2022-12-12 11:37:26,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 1363 transitions, 15461 flow [2022-12-12 11:37:26,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1363 transitions, 13113 flow, removed 1084 selfloop flow, removed 90 redundant places. [2022-12-12 11:37:26,300 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 1363 transitions, 13113 flow [2022-12-12 11:37:26,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 198.47692307692307) internal successors, (25802), 130 states have internal predecessors, (25802), 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-12 11:37:26,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 11:37:26,307 INFO L214 CegarLoopForPetriNet]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:37:26,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 11:37:26,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:37:26,515 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 11:37:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 11:37:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1408440331, now seen corresponding path program 3 times [2022-12-12 11:37:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 11:37:26,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418200882] [2022-12-12 11:37:26,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 11:37:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 11:37:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 11:37:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 56576 backedges. 0 proven. 56576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 11:37:45,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 11:37:45,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418200882] [2022-12-12 11:37:45,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418200882] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 11:37:45,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14273822] [2022-12-12 11:37:45,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 11:37:45,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:37:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 11:37:45,156 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-12 11:37:45,164 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-12 11:37:45,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-12 11:37:45,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 11:37:45,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-12 11:37:45,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 11:37:55,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-12 11:37:55,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 11:37:55,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-12 11:37:56,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 11:37:56,069 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 11:37:56,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 11:37:56,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 11:37:56,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 11:37:56,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-12-12 11:37:56,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 11:37:56,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-12 11:37:56,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 11:37:56,825 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-12 11:37:56,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-12 11:37:56,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 11:37:56,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-12 11:37:56,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-12 11:37:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 56576 backedges. 3640 proven. 1366 refuted. 0 times theorem prover too weak. 51570 trivial. 0 not checked. [2022-12-12 11:37:56,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 11:37:57,737 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2707 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| Int) (v_ArrVal_2706 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2706) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_2707) .cse1) 800))))) is different from false [2022-12-12 11:37:58,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2705 Int) (v_ArrVal_2707 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| Int) (v_ArrVal_2706 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2705)) |c_~#stored_elements~0.base| v_ArrVal_2706) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_2707) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| (select .cse0 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2705)))) is different from false [2022-12-12 11:37:58,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2705 Int) (v_ArrVal_2707 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2703 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2703) .cse1 v_ArrVal_2705)) |c_~#stored_elements~0.base| v_ArrVal_2706) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2705) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_2707) .cse3) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| (select .cse2 .cse3))))))) is different from false [2022-12-12 11:37:58,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2705 Int) (v_ArrVal_2707 Int) (v_ArrVal_2700 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2703 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2700)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2703) .cse3 v_ArrVal_2705)) |c_~#stored_elements~0.base| v_ArrVal_2706) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_2707) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2705) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| (select .cse0 .cse1))))))) is different from false [2022-12-12 11:37:59,177 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2705 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| Int) (v_ArrVal_2707 Int) (v_ArrVal_2700 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| Int) (v_ArrVal_2706 (Array Int Int)) (v_ArrVal_2703 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| 4)) v_ArrVal_2700)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2703) .cse1 v_ArrVal_2705)) |c_~#stored_elements~0.base| v_ArrVal_2706) |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_186| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2705) (not (= 800 (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| 4) |c_~#queue~0.offset|) v_ArrVal_2707) .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_183| (select .cse3 .cse4)))))))) is different from false [2022-12-12 11:38:04,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 11:38:04,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 134 [2022-12-12 11:38:04,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 11:38:04,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 262 treesize of output 262 [2022-12-12 11:38:04,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 165 [2022-12-12 11:38:04,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 175 [2022-12-12 11:38:04,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-12 11:38:04,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 11:38:04,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 74 [2022-12-12 11:38:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 56576 backedges. 1821 proven. 1359 refuted. 935 times theorem prover too weak. 51570 trivial. 891 not checked. [2022-12-12 11:38:15,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14273822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 11:38:15,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 11:38:15,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 20, 22] total 167 [2022-12-12 11:38:15,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101224243] [2022-12-12 11:38:15,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 11:38:15,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 167 states [2022-12-12 11:38:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 11:38:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2022-12-12 11:38:15,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4451, Invalid=21611, Unknown=40, NotChecked=1620, Total=27722 [2022-12-12 11:38:15,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 215 [2022-12-12 11:38:15,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1363 transitions, 13113 flow. Second operand has 167 states, 167 states have (on average 148.51497005988023) internal successors, (24802), 167 states have internal predecessors, (24802), 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-12 11:38:15,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 11:38:15,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 215 [2022-12-12 11:38:15,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 11:49:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1426 states. [2022-12-12 11:49:18,199 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 11:49:18,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 11:49:18,221 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 11:49:18,234 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 11:49:18,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 11:49:18,400 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 1588 known predicates. [2022-12-12 11:49:18,401 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-12 11:49:18,401 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 11:49:18,402 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 11:49:18,402 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-12 11:49:18,402 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1] [2022-12-12 11:49:18,429 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 11:49:18,429 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 11:49:18,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 11:49:18 BasicIcfg [2022-12-12 11:49:18,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 11:49:18,435 INFO L158 Benchmark]: Toolchain (without parser) took 774220.49ms. Allocated memory was 185.6MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 160.6MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 11:49:18,435 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 163.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 11:49:18,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.96ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 130.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 11:49:18,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.92ms. Allocated memory is still 185.6MB. Free memory was 130.3MB in the beginning and 127.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-12 11:49:18,435 INFO L158 Benchmark]: Boogie Preprocessor took 36.56ms. Allocated memory is still 185.6MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 11:49:18,436 INFO L158 Benchmark]: RCFGBuilder took 592.53ms. Allocated memory is still 185.6MB. Free memory was 125.0MB in the beginning and 104.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-12 11:49:18,436 INFO L158 Benchmark]: TraceAbstraction took 772943.42ms. Allocated memory was 185.6MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 103.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-12 11:49:18,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 163.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 563.96ms. Allocated memory is still 185.6MB. Free memory was 160.1MB in the beginning and 130.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.92ms. Allocated memory is still 185.6MB. Free memory was 130.3MB in the beginning and 127.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.56ms. Allocated memory is still 185.6MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 592.53ms. Allocated memory is still 185.6MB. Free memory was 125.0MB in the beginning and 104.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 772943.42ms. Allocated memory was 185.6MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 103.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 1588 known predicates. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 1588 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 1588 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 1588 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 325 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.3s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 772.8s, OverallIterations: 12, TraceHistogramMax: 63, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 698.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39284 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39284 mSDsluCounter, 1738 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3160 IncrementalHoareTripleChecker+Unchecked, 1591 mSDsCounter, 2811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6587 IncrementalHoareTripleChecker+Invalid, 12558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2811 mSolverCounterUnsat, 147 mSDtfsCounter, 6587 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13632 GetRequests, 10876 SyntacticMatches, 622 SemanticMatches, 2133 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1735152 ImplicationChecksByTransitivity, 609.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13113occurred in iteration=11, InterpolantAutomatonStates: 393, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 4575 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 68.9s InterpolantComputationTime, 10505 NumberOfCodeBlocks, 8263 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 14885 ConstructedInterpolants, 52 QuantifiedInterpolants, 63881 SizeOfPredicates, 149 NumberOfNonLiveVariables, 6059 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 111751/227523 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown