/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:13:46,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:13:46,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:13:46,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:13:46,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:13:46,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:13:46,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:13:46,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:13:46,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:13:46,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:13:46,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:13:46,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:13:46,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:13:46,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:13:46,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:13:46,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:13:46,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:13:46,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:13:46,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:13:46,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:13:46,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:13:46,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:13:46,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:13:46,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:13:46,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:13:46,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:13:46,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:13:46,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:13:46,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:13:46,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:13:46,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:13:46,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:13:46,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:13:46,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:13:46,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:13:46,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:13:46,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:13:46,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:13:46,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:13:46,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:13:46,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:13:46,183 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-RepeatedSemanticLbe.epf [2022-12-06 00:13:46,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:13:46,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:13:46,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:13:46,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:13:46,213 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:13:46,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:13:46,214 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:13:46,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:13:46,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:13:46,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:13:46,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:13:46,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:13:46,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:13:46,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:13:46,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:13:46,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:13:46,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:13:46,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:13:46,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:13:46,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:13:46,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:13:46,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:13:46,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:13:46,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:13:46,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:13:46,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:13:46,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:13:46,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:13:46,217 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 [2022-12-06 00:13:46,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:13:46,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:13:46,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:13:46,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:13:46,807 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:13:46,808 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-06 00:13:48,379 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:13:48,560 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:13:48,561 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-06 00:13:48,567 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3759bfbf2/687f21637be546b9921a7466ac0faaf1/FLAG3dbd1a893 [2022-12-06 00:13:48,578 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3759bfbf2/687f21637be546b9921a7466ac0faaf1 [2022-12-06 00:13:48,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:13:48,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:13:48,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:13:48,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:13:48,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:13:48,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9deff2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48, skipping insertion in model container [2022-12-06 00:13:48,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:13:48,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:13:48,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:48,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:48,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:48,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:48,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:48,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:48,727 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-06 00:13:48,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:13:48,738 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:13:48,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:48,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:48,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:48,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:48,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:13:48,749 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:13:48,751 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-06 00:13:48,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:13:48,775 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:13:48,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48 WrapperNode [2022-12-06 00:13:48,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:13:48,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:13:48,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:13:48,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:13:48,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,831 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 191 [2022-12-06 00:13:48,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:13:48,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:13:48,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:13:48,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:13:48,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,854 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:13:48,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:13:48,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:13:48,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:13:48,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (1/1) ... [2022-12-06 00:13:48,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:13:48,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:13:48,897 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-06 00:13:48,912 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-06 00:13:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:13:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:13:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:13:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:13:48,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:13:48,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:13:48,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:13:48,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:13:48,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:13:48,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:13:48,926 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:13:49,023 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:13:49,025 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:13:49,331 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:13:49,446 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:13:49,446 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:13:49,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:13:49 BoogieIcfgContainer [2022-12-06 00:13:49,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:13:49,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:13:49,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:13:49,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:13:49,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:13:48" (1/3) ... [2022-12-06 00:13:49,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79eeb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:13:49, skipping insertion in model container [2022-12-06 00:13:49,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:13:48" (2/3) ... [2022-12-06 00:13:49,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d79eeb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:13:49, skipping insertion in model container [2022-12-06 00:13:49,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:13:49" (3/3) ... [2022-12-06 00:13:49,462 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-12-06 00:13:49,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:13:49,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:13:49,475 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:13:49,518 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:13:49,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 00:13:49,611 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-06 00:13:49,611 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:49,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 00:13:49,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-06 00:13:49,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-06 00:13:49,626 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:49,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 00:13:49,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 274 flow [2022-12-06 00:13:49,685 INFO L130 PetriNetUnfolder]: 12/128 cut-off events. [2022-12-06 00:13:49,685 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:49,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 12/128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-06 00:13:49,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-06 00:13:49,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 00:13:54,472 INFO L203 LiptonReduction]: Total number of compositions: 104 [2022-12-06 00:13:54,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:13:54,486 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=REPEATED_LIPTON_PN, 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;@4236bcb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:13:54,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:13:54,491 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 00:13:54,491 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:54,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:54,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:54,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:54,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:54,495 INFO L85 PathProgramCache]: Analyzing trace with hash 192526010, now seen corresponding path program 1 times [2022-12-06 00:13:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:54,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785633390] [2022-12-06 00:13:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:54,872 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-06 00:13:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:54,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785633390] [2022-12-06 00:13:54,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785633390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:54,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:54,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:13:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94491933] [2022-12-06 00:13:54,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:54,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:13:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:54,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:13:54,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:13:54,893 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 00:13:54,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-06 00:13:54,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:54,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 00:13:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:55,008 INFO L130 PetriNetUnfolder]: 360/508 cut-off events. [2022-12-06 00:13:55,009 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 00:13:55,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 360/508 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1627 event pairs, 39 based on Foata normal form. 1/305 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-06 00:13:55,016 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2022-12-06 00:13:55,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2022-12-06 00:13:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:13:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:13:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-06 00:13:55,025 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6527777777777778 [2022-12-06 00:13:55,026 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 47 transitions. [2022-12-06 00:13:55,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2022-12-06 00:13:55,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 165 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:13:55,031 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2022-12-06 00:13:55,033 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2022-12-06 00:13:55,036 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 00:13:55,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:55,037 INFO L89 Accepts]: Start accepts. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 00:13:55,039 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:55,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:55,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 00:13:55,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 27 transitions, 80 flow [2022-12-06 00:13:55,046 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][25], [Black: 144#(= ~res2~0 ~res1~0), 63#L92-2true, 142#true]) [2022-12-06 00:13:55,046 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:13:55,046 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:13:55,047 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:13:55,047 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:13:55,048 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 00:13:55,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:13:55,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 64 events. 23/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 64. Up to 26 conditions per place. [2022-12-06 00:13:55,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 27 transitions, 80 flow [2022-12-06 00:13:55,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:13:55,049 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:55,050 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 00:13:55,050 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2022-12-06 00:13:55,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-06 00:13:55,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:55,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:55,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:13:55,051 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash -440998104, now seen corresponding path program 1 times [2022-12-06 00:13:55,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:55,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759695413] [2022-12-06 00:13:55,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:55,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:55,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759695413] [2022-12-06 00:13:55,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759695413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:55,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:55,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:13:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498908162] [2022-12-06 00:13:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:55,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:13:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:13:55,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:13:55,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 00:13:55,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 00:13:55,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:55,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 00:13:55,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:55,503 INFO L130 PetriNetUnfolder]: 665/977 cut-off events. [2022-12-06 00:13:55,503 INFO L131 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2022-12-06 00:13:55,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 977 events. 665/977 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4048 event pairs, 182 based on Foata normal form. 38/1003 useless extension candidates. Maximal degree in co-relation 488. Up to 368 conditions per place. [2022-12-06 00:13:55,508 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 64 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-06 00:13:55,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 71 transitions, 348 flow [2022-12-06 00:13:55,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:13:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:13:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-12-06 00:13:55,509 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2022-12-06 00:13:55,509 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 6 states and 73 transitions. [2022-12-06 00:13:55,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 71 transitions, 348 flow [2022-12-06 00:13:55,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:13:55,511 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 115 flow [2022-12-06 00:13:55,511 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2022-12-06 00:13:55,512 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2022-12-06 00:13:55,512 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:55,512 INFO L89 Accepts]: Start accepts. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 00:13:55,513 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:55,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:55,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 00:13:55,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 115 flow [2022-12-06 00:13:55,523 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][29], [Black: 144#(= ~res2~0 ~res1~0), 63#L92-2true, Black: 146#true, Black: 154#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 148#(or (not (<= ~M~0 ~N~0)) (not (<= 0 ~M~0)) (and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 152#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-06 00:13:55,523 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2022-12-06 00:13:55,523 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:13:55,523 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:13:55,523 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2022-12-06 00:13:55,523 INFO L130 PetriNetUnfolder]: 30/102 cut-off events. [2022-12-06 00:13:55,523 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-06 00:13:55,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 102 events. 30/102 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 338 event pairs, 1 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 107. Up to 35 conditions per place. [2022-12-06 00:13:55,524 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 115 flow [2022-12-06 00:13:55,525 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 00:13:58,211 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:13:58,212 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2700 [2022-12-06 00:13:58,212 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 121 flow [2022-12-06 00:13:58,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 00:13:58,213 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:58,213 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:58,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:13:58,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash 443967071, now seen corresponding path program 1 times [2022-12-06 00:13:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:58,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870062051] [2022-12-06 00:13:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:58,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:58,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870062051] [2022-12-06 00:13:58,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870062051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:58,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:58,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:13:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532627967] [2022-12-06 00:13:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:58,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:58,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:58,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:58,337 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 00:13:58,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-06 00:13:58,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:58,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 00:13:58,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:58,779 INFO L130 PetriNetUnfolder]: 489/763 cut-off events. [2022-12-06 00:13:58,779 INFO L131 PetriNetUnfolder]: For 404/430 co-relation queries the response was YES. [2022-12-06 00:13:58,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 763 events. 489/763 cut-off events. For 404/430 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3304 event pairs, 189 based on Foata normal form. 52/779 useless extension candidates. Maximal degree in co-relation 1361. Up to 485 conditions per place. [2022-12-06 00:13:58,784 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 51 selfloop transitions, 2 changer transitions 1/57 dead transitions. [2022-12-06 00:13:58,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 301 flow [2022-12-06 00:13:58,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 00:13:58,786 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5576923076923077 [2022-12-06 00:13:58,786 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 121 flow. Second operand 4 states and 58 transitions. [2022-12-06 00:13:58,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 301 flow [2022-12-06 00:13:58,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 295 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 00:13:58,791 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 122 flow [2022-12-06 00:13:58,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2022-12-06 00:13:58,804 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2022-12-06 00:13:58,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:58,804 INFO L89 Accepts]: Start accepts. Operand has 40 places, 31 transitions, 122 flow [2022-12-06 00:13:58,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:58,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:58,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 122 flow [2022-12-06 00:13:58,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 122 flow [2022-12-06 00:13:58,818 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][29], [Black: 144#(= ~res2~0 ~res1~0), Black: 162#(<= ~N~0 0), Black: 163#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 63#L92-2true, 160#true, Black: 146#true, Black: 154#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 148#(or (not (<= ~M~0 ~N~0)) (not (<= 0 ~M~0)) (and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))), Black: 152#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-06 00:13:58,823 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:13:58,823 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:13:58,823 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:13:58,823 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:13:58,824 INFO L130 PetriNetUnfolder]: 24/89 cut-off events. [2022-12-06 00:13:58,824 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-06 00:13:58,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 89 events. 24/89 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 1 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 121. Up to 29 conditions per place. [2022-12-06 00:13:58,825 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 31 transitions, 122 flow [2022-12-06 00:13:58,825 INFO L188 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-06 00:13:58,827 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:58,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 00:13:58,832 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 122 flow [2022-12-06 00:13:58,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-06 00:13:58,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:58,838 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:58,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:13:58,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1262704552, now seen corresponding path program 1 times [2022-12-06 00:13:58,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:58,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880514066] [2022-12-06 00:13:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:13:59,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:59,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880514066] [2022-12-06 00:13:59,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880514066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:59,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:59,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:13:59,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894561494] [2022-12-06 00:13:59,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:59,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:13:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:13:59,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:13:59,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-06 00:13:59,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-06 00:13:59,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:59,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-06 00:13:59,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:13:59,495 INFO L130 PetriNetUnfolder]: 483/740 cut-off events. [2022-12-06 00:13:59,495 INFO L131 PetriNetUnfolder]: For 515/540 co-relation queries the response was YES. [2022-12-06 00:13:59,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 740 events. 483/740 cut-off events. For 515/540 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2892 event pairs, 248 based on Foata normal form. 47/784 useless extension candidates. Maximal degree in co-relation 1583. Up to 568 conditions per place. [2022-12-06 00:13:59,499 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 26 selfloop transitions, 0 changer transitions 26/53 dead transitions. [2022-12-06 00:13:59,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 282 flow [2022-12-06 00:13:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:13:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:13:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 00:13:59,501 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.53 [2022-12-06 00:13:59,501 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 122 flow. Second operand 4 states and 53 transitions. [2022-12-06 00:13:59,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 282 flow [2022-12-06 00:13:59,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 273 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:13:59,519 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 91 flow [2022-12-06 00:13:59,519 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 00:13:59,521 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2022-12-06 00:13:59,521 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:13:59,521 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 91 flow [2022-12-06 00:13:59,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:13:59,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:13:59,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 91 flow [2022-12-06 00:13:59,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 91 flow [2022-12-06 00:13:59,537 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][25], [Black: 144#(= ~res2~0 ~res1~0), Black: 162#(<= ~N~0 0), Black: 163#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 63#L92-2true, Black: 169#(and (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= ~M~0 0)), Black: 146#true, Black: 168#(<= ~M~0 0), Black: 154#(and (<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|) (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 152#(and (<= 0 ~M~0) (<= ~M~0 ~N~0) (<= ~N~0 ~M~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-06 00:13:59,537 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:13:59,537 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:13:59,538 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:13:59,538 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2022-12-06 00:13:59,539 INFO L130 PetriNetUnfolder]: 23/64 cut-off events. [2022-12-06 00:13:59,539 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:13:59,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 64 events. 23/64 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 144 event pairs, 1 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 99. Up to 26 conditions per place. [2022-12-06 00:13:59,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 91 flow [2022-12-06 00:13:59,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:13:59,551 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:13:59,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 00:13:59,576 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 91 flow [2022-12-06 00:13:59,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-06 00:13:59,576 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:13:59,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:13:59,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:13:59,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:13:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:13:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -555608095, now seen corresponding path program 1 times [2022-12-06 00:13:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:13:59,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178843156] [2022-12-06 00:13:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:13:59,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:13:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:13:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:13:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:13:59,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178843156] [2022-12-06 00:13:59,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178843156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:13:59,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:13:59,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 00:13:59,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063327786] [2022-12-06 00:13:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:13:59,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:13:59,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:13:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:13:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:13:59,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 00:13:59,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 91 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-06 00:13:59,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:13:59,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 00:13:59,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:00,079 INFO L130 PetriNetUnfolder]: 544/798 cut-off events. [2022-12-06 00:14:00,079 INFO L131 PetriNetUnfolder]: For 466/466 co-relation queries the response was YES. [2022-12-06 00:14:00,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 798 events. 544/798 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3069 event pairs, 139 based on Foata normal form. 16/811 useless extension candidates. Maximal degree in co-relation 2180. Up to 410 conditions per place. [2022-12-06 00:14:00,084 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 58 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-12-06 00:14:00,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 67 transitions, 361 flow [2022-12-06 00:14:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:14:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:14:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-12-06 00:14:00,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 00:14:00,085 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 91 flow. Second operand 6 states and 64 transitions. [2022-12-06 00:14:00,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 67 transitions, 361 flow [2022-12-06 00:14:00,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 67 transitions, 330 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-12-06 00:14:00,092 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 133 flow [2022-12-06 00:14:00,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2022-12-06 00:14:00,093 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2022-12-06 00:14:00,093 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:00,093 INFO L89 Accepts]: Start accepts. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 00:14:00,094 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:00,094 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:00,094 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 00:14:00,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 133 flow [2022-12-06 00:14:00,103 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][30], [182#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 144#(= ~res2~0 ~res1~0), 63#L92-2true, Black: 180#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 146#true, Black: 184#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-06 00:14:00,103 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 00:14:00,103 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:14:00,103 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 00:14:00,104 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 00:14:00,104 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([534] thread3EXIT-->L92-2: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem21#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_5|} AuxVars[] AssignedVars[][30], [Black: 144#(= ~res2~0 ~res1~0), 182#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 63#L92-2true, Black: 180#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 146#true, Black: 184#(and (<= (+ ~M~0 1) ~N~0) (<= (+ |thread3Thread1of1ForFork2_~i~2#1| 1) ~N~0) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 150#(<= ~N~0 |thread3Thread1of1ForFork2_~i~2#1|)]) [2022-12-06 00:14:00,104 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2022-12-06 00:14:00,104 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:14:00,104 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:14:00,104 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 00:14:00,104 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2022-12-06 00:14:00,105 INFO L130 PetriNetUnfolder]: 29/84 cut-off events. [2022-12-06 00:14:00,105 INFO L131 PetriNetUnfolder]: For 11/17 co-relation queries the response was YES. [2022-12-06 00:14:00,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 84 events. 29/84 cut-off events. For 11/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 230 event pairs, 1 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 132. Up to 33 conditions per place. [2022-12-06 00:14:00,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 32 transitions, 133 flow [2022-12-06 00:14:00,115 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 00:14:00,177 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:14:00,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 00:14:00,177 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 99 flow [2022-12-06 00:14:00,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-06 00:14:00,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:00,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:14:00,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:14:00,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:14:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash -181262365, now seen corresponding path program 1 times [2022-12-06 00:14:00,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:00,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976650115] [2022-12-06 00:14:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:00,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:14:00,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:00,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976650115] [2022-12-06 00:14:00,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976650115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:00,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:00,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:14:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486531085] [2022-12-06 00:14:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:00,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:00,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:00,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:00,273 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 00:14:00,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-06 00:14:00,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:00,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 00:14:00,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:00,442 INFO L130 PetriNetUnfolder]: 242/410 cut-off events. [2022-12-06 00:14:00,443 INFO L131 PetriNetUnfolder]: For 556/556 co-relation queries the response was YES. [2022-12-06 00:14:00,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1269 conditions, 410 events. 242/410 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1582 event pairs, 81 based on Foata normal form. 12/419 useless extension candidates. Maximal degree in co-relation 476. Up to 246 conditions per place. [2022-12-06 00:14:00,445 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 39 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2022-12-06 00:14:00,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 249 flow [2022-12-06 00:14:00,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:14:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:14:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 00:14:00,445 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2022-12-06 00:14:00,445 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 99 flow. Second operand 5 states and 46 transitions. [2022-12-06 00:14:00,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 249 flow [2022-12-06 00:14:00,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 241 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:14:00,447 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 111 flow [2022-12-06 00:14:00,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2022-12-06 00:14:00,448 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2022-12-06 00:14:00,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:00,448 INFO L89 Accepts]: Start accepts. Operand has 37 places, 26 transitions, 111 flow [2022-12-06 00:14:00,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:00,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:00,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 26 transitions, 111 flow [2022-12-06 00:14:00,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 111 flow [2022-12-06 00:14:00,457 INFO L130 PetriNetUnfolder]: 7/45 cut-off events. [2022-12-06 00:14:00,457 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 00:14:00,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 45 events. 7/45 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 62. Up to 11 conditions per place. [2022-12-06 00:14:00,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 111 flow [2022-12-06 00:14:00,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 154 [2022-12-06 00:14:00,458 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:14:00,459 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 00:14:00,459 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 111 flow [2022-12-06 00:14:00,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-06 00:14:00,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:14:00,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:14:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:14:00,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:14:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:14:00,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1642832645, now seen corresponding path program 2 times [2022-12-06 00:14:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:14:00,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910961373] [2022-12-06 00:14:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:14:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:14:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:14:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:14:00,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:14:00,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910961373] [2022-12-06 00:14:00,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910961373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:14:00,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:14:00,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:14:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531013209] [2022-12-06 00:14:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:14:00,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:14:00,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:14:00,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:14:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:14:00,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-06 00:14:00,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-06 00:14:00,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:14:00,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-06 00:14:00,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:14:00,786 INFO L130 PetriNetUnfolder]: 202/335 cut-off events. [2022-12-06 00:14:00,786 INFO L131 PetriNetUnfolder]: For 542/542 co-relation queries the response was YES. [2022-12-06 00:14:00,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 335 events. 202/335 cut-off events. For 542/542 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1189 event pairs, 81 based on Foata normal form. 16/348 useless extension candidates. Maximal degree in co-relation 468. Up to 246 conditions per place. [2022-12-06 00:14:00,788 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 34 selfloop transitions, 7 changer transitions 1/43 dead transitions. [2022-12-06 00:14:00,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 258 flow [2022-12-06 00:14:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:14:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:14:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-06 00:14:00,789 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2022-12-06 00:14:00,789 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 111 flow. Second operand 5 states and 43 transitions. [2022-12-06 00:14:00,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 258 flow [2022-12-06 00:14:00,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 227 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 00:14:00,790 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 116 flow [2022-12-06 00:14:00,790 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2022-12-06 00:14:00,791 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-06 00:14:00,791 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:14:00,799 INFO L89 Accepts]: Start accepts. Operand has 38 places, 28 transitions, 116 flow [2022-12-06 00:14:00,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:00,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:14:00,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 116 flow [2022-12-06 00:14:00,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 28 transitions, 116 flow [2022-12-06 00:14:00,813 INFO L130 PetriNetUnfolder]: 13/50 cut-off events. [2022-12-06 00:14:00,813 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-06 00:14:00,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 50 events. 13/50 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2022-12-06 00:14:00,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 28 transitions, 116 flow [2022-12-06 00:14:00,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 164 [2022-12-06 00:14:00,831 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] L67-4-->L67-4: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread3Thread1of1ForFork2_plus_~b#1_17| |v_thread3Thread1of1ForFork2_plus_#in~b#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| v_~res2~0_101) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_17| v_~res2~0_102) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_93| v_~A~0.base_70) (+ v_~A~0.offset_70 (* |v_thread3Thread1of1ForFork2_~i~2#1_32| 4)))) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_#in~a#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| .cse0) (= (+ |v_thread3Thread1of1ForFork2_~i~2#1_32| 1) |v_thread3Thread1of1ForFork2_~i~2#1_31|) (< |v_thread3Thread1of1ForFork2_~i~2#1_32| v_~N~0_39) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483647))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, #memory_int=|v_#memory_int_93|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_32|, ~res2~0=v_~res2~0_102} OutVars{~A~0.base=v_~A~0.base_70, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_31|, ~A~0.offset=v_~A~0.offset_70, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_17|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_17|, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_17|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_17|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_17|, ~res2~0=v_~res2~0_101, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, thread3Thread1of1ForFork2_~i~2#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1] and [516] $Ultimate##0-->L67-4: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1] [2022-12-06 00:14:00,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [600] L67-4-->L67-4: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_thread3Thread1of1ForFork2_plus_~b#1_17| |v_thread3Thread1of1ForFork2_plus_#in~b#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| v_~res2~0_101) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_17| v_~res2~0_102) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_93| v_~A~0.base_70) (+ v_~A~0.offset_70 (* |v_thread3Thread1of1ForFork2_~i~2#1_32| 4)))) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17| |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_~a#1_17| |v_thread3Thread1of1ForFork2_plus_#in~a#1_17|) (= (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_17| 0)) 1 0) |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|) (= |v_thread3Thread1of1ForFork2_plus_#res#1_17| .cse0) (= (+ |v_thread3Thread1of1ForFork2_~i~2#1_32| 1) |v_thread3Thread1of1ForFork2_~i~2#1_31|) (< |v_thread3Thread1of1ForFork2_~i~2#1_32| v_~N~0_39) (<= |v_thread3Thread1of1ForFork2_plus_#res#1_17| 2147483647))) InVars {~A~0.base=v_~A~0.base_70, ~A~0.offset=v_~A~0.offset_70, #memory_int=|v_#memory_int_93|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_32|, ~res2~0=v_~res2~0_102} OutVars{~A~0.base=v_~A~0.base_70, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_17|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_17|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_31|, ~A~0.offset=v_~A~0.offset_70, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_17|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_17|, #memory_int=|v_#memory_int_93|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_17|, thread3Thread1of1ForFork2_#t~ret9#1=|v_thread3Thread1of1ForFork2_#t~ret9#1_17|, thread3Thread1of1ForFork2_#t~post7#1=|v_thread3Thread1of1ForFork2_#t~post7#1_17|, ~res2~0=v_~res2~0_101, thread3Thread1of1ForFork2_#t~mem8#1=|v_thread3Thread1of1ForFork2_#t~mem8#1_17|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret9#1, thread3Thread1of1ForFork2_#t~post7#1, thread3Thread1of1ForFork2_~i~2#1, ~res2~0, thread3Thread1of1ForFork2_#t~mem8#1] and [516] $Ultimate##0-->L67-4: Formula: (= |v_thread3Thread1of1ForFork2_~i~2#1_1| v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2#1] [2022-12-06 00:14:01,071 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 00:14:01,076 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:14:01,076 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 00:14:01,076 INFO L89 Accepts]: Start accepts. Operand has 37 places, 28 transitions, 122 flow [2022-12-06 00:14:01,077 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:14:01,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:14:01,077 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:14:01,080 INFO L158 Benchmark]: Toolchain (without parser) took 12499.51ms. Allocated memory was 198.2MB in the beginning and 305.1MB in the end (delta: 107.0MB). Free memory was 174.4MB in the beginning and 174.7MB in the end (delta: -335.9kB). Peak memory consumption was 107.7MB. Max. memory is 8.0GB. [2022-12-06 00:14:01,080 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 198.2MB. Free memory was 174.9MB in the beginning and 174.7MB in the end (delta: 140.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:14:01,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.30ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 161.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:14:01,080 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.19ms. Allocated memory is still 198.2MB. Free memory was 161.3MB in the beginning and 159.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:14:01,080 INFO L158 Benchmark]: Boogie Preprocessor took 41.80ms. Allocated memory is still 198.2MB. Free memory was 159.2MB in the beginning and 157.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:14:01,081 INFO L158 Benchmark]: RCFGBuilder took 573.98ms. Allocated memory is still 198.2MB. Free memory was 157.6MB in the beginning and 125.6MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 00:14:01,081 INFO L158 Benchmark]: TraceAbstraction took 11630.21ms. Allocated memory was 198.2MB in the beginning and 305.1MB in the end (delta: 107.0MB). Free memory was 125.1MB in the beginning and 174.7MB in the end (delta: -49.6MB). Peak memory consumption was 58.4MB. Max. memory is 8.0GB. [2022-12-06 00:14:01,082 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.14ms. Allocated memory is still 198.2MB. Free memory was 174.9MB in the beginning and 174.7MB in the end (delta: 140.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.30ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 161.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.19ms. Allocated memory is still 198.2MB. Free memory was 161.3MB in the beginning and 159.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.80ms. Allocated memory is still 198.2MB. Free memory was 159.2MB in the beginning and 157.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 573.98ms. Allocated memory is still 198.2MB. Free memory was 157.6MB in the beginning and 125.6MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11630.21ms. Allocated memory was 198.2MB in the beginning and 305.1MB in the end (delta: 107.0MB). Free memory was 125.1MB in the beginning and 174.7MB in the end (delta: -49.6MB). Peak memory consumption was 58.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 126 PlacesBefore, 30 PlacesAfterwards, 128 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 673, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 680, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 680, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 680, unknown conditional: 0, unknown unconditional: 680] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1057, Positive conditional cache size: 0, Positive unconditional cache size: 1057, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 36 PlacesBefore, 35 PlacesAfterwards, 32 TransitionsBefore, 27 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 57, independent conditional: 36, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 57, independent: 57, independent conditional: 36, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 18, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, independent: 25, independent conditional: 18, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 32, unknown conditional: 18, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 18, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 32, Positive conditional cache size: 18, Positive unconditional cache size: 14, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, independent: 14, independent conditional: 6, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 6, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 8, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 38, Positive conditional cache size: 20, Positive unconditional cache size: 18, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:14:01,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...