/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:32:07,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:32:07,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:32:07,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:32:07,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:32:07,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:32:07,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:32:07,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:32:07,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:32:07,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:32:07,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:32:07,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:32:07,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:32:07,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:32:07,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:32:07,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:32:07,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:32:07,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:32:07,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:32:07,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:32:07,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:32:07,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:32:07,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:32:07,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:32:07,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:32:07,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:32:07,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:32:07,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:32:07,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:32:07,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:32:07,654 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:32:07,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:32:07,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:32:07,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:32:07,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:32:07,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:32:07,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:32:07,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:32:07,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:32:07,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:32:07,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:32:07,661 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:32:07,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:32:07,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:32:07,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:32:07,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:32:07,690 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:32:07,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:32:07,690 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:32:07,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:32:07,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:32:07,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:32:07,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:32:07,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:32:07,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:32:07,691 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:32:07,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:32:07,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:32:07,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:32:07,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:32:07,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:32:07,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:32:07,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:32:07,693 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 07:32:07,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:32:07,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:32:07,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:32:07,958 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:32:07,958 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:32:07,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 07:32:08,892 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:32:09,094 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:32:09,094 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 07:32:09,100 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddf3e9cd/acae03708f8543ce89e504196825aaa0/FLAGd0c343a3a [2022-12-06 07:32:09,113 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ddf3e9cd/acae03708f8543ce89e504196825aaa0 [2022-12-06 07:32:09,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:32:09,116 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:32:09,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:32:09,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:32:09,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:32:09,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,121 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61d934d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09, skipping insertion in model container [2022-12-06 07:32:09,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:32:09,151 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:32:09,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,288 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 07:32:09,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:32:09,306 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:32:09,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,318 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:32:09,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:32:09,343 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 07:32:09,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:32:09,363 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:32:09,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09 WrapperNode [2022-12-06 07:32:09,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:32:09,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:32:09,365 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:32:09,365 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:32:09,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,400 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-12-06 07:32:09,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:32:09,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:32:09,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:32:09,401 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:32:09,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,434 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:32:09,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:32:09,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:32:09,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:32:09,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (1/1) ... [2022-12-06 07:32:09,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:32:09,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:32:09,474 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 07:32:09,482 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 07:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:32:09,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:32:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:32:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:32:09,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:32:09,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:32:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:32:09,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:32:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 07:32:09,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 07:32:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:32:09,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:32:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:32:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:32:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:32:09,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:32:09,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:32:09,510 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 07:32:09,643 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:32:09,652 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:32:10,004 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:32:10,227 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:32:10,228 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 07:32:10,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:32:10 BoogieIcfgContainer [2022-12-06 07:32:10,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:32:10,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:32:10,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:32:10,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:32:10,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:32:09" (1/3) ... [2022-12-06 07:32:10,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608fa443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:32:10, skipping insertion in model container [2022-12-06 07:32:10,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:32:09" (2/3) ... [2022-12-06 07:32:10,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608fa443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:32:10, skipping insertion in model container [2022-12-06 07:32:10,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:32:10" (3/3) ... [2022-12-06 07:32:10,235 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 07:32:10,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:32:10,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:32:10,251 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:32:10,330 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 07:32:10,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 07:32:10,446 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-06 07:32:10,446 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:32:10,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 222 events. 19/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-06 07:32:10,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 07:32:10,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 210 transitions, 444 flow [2022-12-06 07:32:10,460 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:10,477 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 07:32:10,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 210 transitions, 444 flow [2022-12-06 07:32:10,511 INFO L130 PetriNetUnfolder]: 19/210 cut-off events. [2022-12-06 07:32:10,511 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:32:10,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 210 events. 19/210 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 105 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-06 07:32:10,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 210 transitions, 444 flow [2022-12-06 07:32:10,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 1824 [2022-12-06 07:32:19,985 INFO L203 LiptonReduction]: Total number of compositions: 175 [2022-12-06 07:32:19,996 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:32:20,000 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;@a7bc2ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:32:20,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 07:32:20,006 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-06 07:32:20,006 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:32:20,006 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:20,006 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, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:20,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:32:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1402613233, now seen corresponding path program 1 times [2022-12-06 07:32:20,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453777234] [2022-12-06 07:32:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:20,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:20,547 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 07:32:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:20,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453777234] [2022-12-06 07:32:20,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453777234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:20,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:20,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:32:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440758352] [2022-12-06 07:32:20,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:20,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:32:20,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:20,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:32:20,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:32:20,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 07:32:20,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:20,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:20,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 07:32:20,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:20,944 INFO L130 PetriNetUnfolder]: 2592/3424 cut-off events. [2022-12-06 07:32:20,944 INFO L131 PetriNetUnfolder]: For 281/281 co-relation queries the response was YES. [2022-12-06 07:32:20,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3424 events. 2592/3424 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 14384 event pairs, 355 based on Foata normal form. 0/2355 useless extension candidates. Maximal degree in co-relation 5848. Up to 1372 conditions per place. [2022-12-06 07:32:20,958 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 66 selfloop transitions, 6 changer transitions 9/84 dead transitions. [2022-12-06 07:32:20,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 84 transitions, 387 flow [2022-12-06 07:32:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:32:20,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:32:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2022-12-06 07:32:20,966 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2022-12-06 07:32:20,967 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 94 flow. Second operand 6 states and 101 transitions. [2022-12-06 07:32:20,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 84 transitions, 387 flow [2022-12-06 07:32:20,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 84 transitions, 349 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-06 07:32:20,974 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 117 flow [2022-12-06 07:32:20,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2022-12-06 07:32:20,977 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2022-12-06 07:32:20,977 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:20,977 INFO L89 Accepts]: Start accepts. Operand has 42 places, 39 transitions, 117 flow [2022-12-06 07:32:20,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:20,980 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:20,980 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 39 transitions, 117 flow [2022-12-06 07:32:20,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 117 flow [2022-12-06 07:32:20,986 INFO L130 PetriNetUnfolder]: 11/54 cut-off events. [2022-12-06 07:32:20,986 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 07:32:20,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 54 events. 11/54 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 92 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 57. Up to 8 conditions per place. [2022-12-06 07:32:20,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 117 flow [2022-12-06 07:32:20,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 07:32:21,008 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:32:21,009 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 07:32:21,009 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 117 flow [2022-12-06 07:32:21,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:32:21,009 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:21,009 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:21,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:32:21,010 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 2 more)] === [2022-12-06 07:32:21,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:21,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1996718852, now seen corresponding path program 1 times [2022-12-06 07:32:21,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:21,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129087726] [2022-12-06 07:32:21,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:21,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:21,086 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 07:32:21,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:21,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129087726] [2022-12-06 07:32:21,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129087726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:32:21,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:32:21,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:32:21,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226425065] [2022-12-06 07:32:21,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:21,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:32:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:21,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:32:21,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:32:21,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2022-12-06 07:32:21,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 07:32:21,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:21,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2022-12-06 07:32:21,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:21,381 INFO L130 PetriNetUnfolder]: 2170/3051 cut-off events. [2022-12-06 07:32:21,382 INFO L131 PetriNetUnfolder]: For 1299/1560 co-relation queries the response was YES. [2022-12-06 07:32:21,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6884 conditions, 3051 events. 2170/3051 cut-off events. For 1299/1560 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14772 event pairs, 1340 based on Foata normal form. 514/2861 useless extension candidates. Maximal degree in co-relation 4328. Up to 2387 conditions per place. [2022-12-06 07:32:21,395 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 30 selfloop transitions, 2 changer transitions 39/79 dead transitions. [2022-12-06 07:32:21,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 357 flow [2022-12-06 07:32:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:32:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:32:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2022-12-06 07:32:21,397 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5885714285714285 [2022-12-06 07:32:21,397 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 117 flow. Second operand 5 states and 103 transitions. [2022-12-06 07:32:21,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 79 transitions, 357 flow [2022-12-06 07:32:21,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 79 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:32:21,399 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 138 flow [2022-12-06 07:32:21,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-06 07:32:21,400 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2022-12-06 07:32:21,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:21,400 INFO L89 Accepts]: Start accepts. Operand has 47 places, 40 transitions, 138 flow [2022-12-06 07:32:21,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:21,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:21,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 40 transitions, 138 flow [2022-12-06 07:32:21,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 138 flow [2022-12-06 07:32:21,407 INFO L130 PetriNetUnfolder]: 12/57 cut-off events. [2022-12-06 07:32:21,407 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 07:32:21,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 57 events. 12/57 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 107 event pairs, 1 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 96. Up to 8 conditions per place. [2022-12-06 07:32:21,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 138 flow [2022-12-06 07:32:21,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 446 [2022-12-06 07:32:22,634 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:22,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1235 [2022-12-06 07:32:22,635 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 134 flow [2022-12-06 07:32:22,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 07:32:22,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:22,635 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:22,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:32:22,636 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 2 more)] === [2022-12-06 07:32:22,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash 377684187, now seen corresponding path program 1 times [2022-12-06 07:32:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:22,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118656632] [2022-12-06 07:32:22,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:22,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:22,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118656632] [2022-12-06 07:32:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118656632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:32:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469588159] [2022-12-06 07:32:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:22,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:32:22,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:32:22,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:32:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:22,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 07:32:22,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:32:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:23,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:32:23,209 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 07:32:23,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469588159] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 07:32:23,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 07:32:23,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 14 [2022-12-06 07:32:23,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881940937] [2022-12-06 07:32:23,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:32:23,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 07:32:23,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:23,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 07:32:23,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-12-06 07:32:23,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 07:32:23,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 07:32:23,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:23,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 07:32:23,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:23,730 INFO L130 PetriNetUnfolder]: 3646/4815 cut-off events. [2022-12-06 07:32:23,730 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2022-12-06 07:32:23,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12333 conditions, 4815 events. 3646/4815 cut-off events. For 2376/2376 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 22531 event pairs, 115 based on Foata normal form. 72/3873 useless extension candidates. Maximal degree in co-relation 12320. Up to 1399 conditions per place. [2022-12-06 07:32:23,749 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 89 selfloop transitions, 15 changer transitions 0/107 dead transitions. [2022-12-06 07:32:23,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 107 transitions, 538 flow [2022-12-06 07:32:23,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:32:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:32:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2022-12-06 07:32:23,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2022-12-06 07:32:23,752 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 134 flow. Second operand 7 states and 121 transitions. [2022-12-06 07:32:23,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 107 transitions, 538 flow [2022-12-06 07:32:23,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 107 transitions, 512 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 07:32:23,759 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 224 flow [2022-12-06 07:32:23,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2022-12-06 07:32:23,760 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2022-12-06 07:32:23,761 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:23,761 INFO L89 Accepts]: Start accepts. Operand has 51 places, 48 transitions, 224 flow [2022-12-06 07:32:23,762 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:23,762 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:23,762 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 224 flow [2022-12-06 07:32:23,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 224 flow [2022-12-06 07:32:23,771 INFO L130 PetriNetUnfolder]: 22/93 cut-off events. [2022-12-06 07:32:23,771 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 07:32:23,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 93 events. 22/93 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 254 event pairs, 1 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 186. Up to 18 conditions per place. [2022-12-06 07:32:23,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 224 flow [2022-12-06 07:32:23,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 660 [2022-12-06 07:32:23,778 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:32:23,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 07:32:23,779 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 224 flow [2022-12-06 07:32:23,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 07:32:23,779 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:23,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:23,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 07:32:23,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:23,984 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 2 more)] === [2022-12-06 07:32:23,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1892802076, now seen corresponding path program 1 times [2022-12-06 07:32:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:23,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419515048] [2022-12-06 07:32:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:23,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:24,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419515048] [2022-12-06 07:32:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419515048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:32:24,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552995271] [2022-12-06 07:32:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:24,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:24,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:32:24,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:32:24,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:32:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:24,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 07:32:24,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:32:25,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 07:32:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:25,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:32:25,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:32:25,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-12-06 07:32:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:25,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552995271] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:32:25,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:32:25,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:32:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159401153] [2022-12-06 07:32:25,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:32:25,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:32:25,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:32:25,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:32:25,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 07:32:25,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 224 flow. Second operand has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 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 07:32:25,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:25,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 07:32:25,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:27,401 INFO L130 PetriNetUnfolder]: 13822/18183 cut-off events. [2022-12-06 07:32:27,401 INFO L131 PetriNetUnfolder]: For 20140/20140 co-relation queries the response was YES. [2022-12-06 07:32:27,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51977 conditions, 18183 events. 13822/18183 cut-off events. For 20140/20140 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 96540 event pairs, 1184 based on Foata normal form. 76/14162 useless extension candidates. Maximal degree in co-relation 33223. Up to 5631 conditions per place. [2022-12-06 07:32:27,478 INFO L137 encePairwiseOnDemand]: 24/35 looper letters, 242 selfloop transitions, 65 changer transitions 14/326 dead transitions. [2022-12-06 07:32:27,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 326 transitions, 1958 flow [2022-12-06 07:32:27,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:32:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:32:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 350 transitions. [2022-12-06 07:32:27,479 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-06 07:32:27,480 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 224 flow. Second operand 17 states and 350 transitions. [2022-12-06 07:32:27,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 326 transitions, 1958 flow [2022-12-06 07:32:27,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 326 transitions, 1878 flow, removed 39 selfloop flow, removed 2 redundant places. [2022-12-06 07:32:27,532 INFO L231 Difference]: Finished difference. Result has 78 places, 114 transitions, 833 flow [2022-12-06 07:32:27,532 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=833, PETRI_PLACES=78, PETRI_TRANSITIONS=114} [2022-12-06 07:32:27,533 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2022-12-06 07:32:27,533 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:27,533 INFO L89 Accepts]: Start accepts. Operand has 78 places, 114 transitions, 833 flow [2022-12-06 07:32:27,534 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:27,534 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:27,534 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 114 transitions, 833 flow [2022-12-06 07:32:27,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 114 transitions, 833 flow [2022-12-06 07:32:27,584 INFO L130 PetriNetUnfolder]: 230/688 cut-off events. [2022-12-06 07:32:27,584 INFO L131 PetriNetUnfolder]: For 1464/1471 co-relation queries the response was YES. [2022-12-06 07:32:27,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 688 events. 230/688 cut-off events. For 1464/1471 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4409 event pairs, 14 based on Foata normal form. 2/665 useless extension candidates. Maximal degree in co-relation 1954. Up to 151 conditions per place. [2022-12-06 07:32:27,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 114 transitions, 833 flow [2022-12-06 07:32:27,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 1870 [2022-12-06 07:32:27,592 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 07:32:27,677 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 07:32:32,187 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:32:32,188 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4655 [2022-12-06 07:32:32,188 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 838 flow [2022-12-06 07:32:32,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.933333333333334) internal successors, (119), 15 states have internal predecessors, (119), 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 07:32:32,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:32,188 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:32,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 07:32:32,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-12-06 07:32:32,396 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 2 more)] === [2022-12-06 07:32:32,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:32,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1417993986, now seen corresponding path program 1 times [2022-12-06 07:32:32,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:32,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022567785] [2022-12-06 07:32:32,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:32,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:32,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022567785] [2022-12-06 07:32:32,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022567785] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:32:32,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013163074] [2022-12-06 07:32:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:32,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:32,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:32:32,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:32:32,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:32:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:33,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:32:33,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:32:33,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:32:33,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:32:33,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:32:33,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:32:33,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:32:33,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:32:33,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:32:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:33,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:32:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:33,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013163074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:32:33,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:32:33,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-12-06 07:32:33,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634313362] [2022-12-06 07:32:33,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:32:33,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:32:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:32:33,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=269, Unknown=5, NotChecked=0, Total=342 [2022-12-06 07:32:33,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2022-12-06 07:32:33,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 113 transitions, 838 flow. Second operand has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 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 07:32:33,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:33,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2022-12-06 07:32:33,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:36,226 INFO L130 PetriNetUnfolder]: 16708/21973 cut-off events. [2022-12-06 07:32:36,226 INFO L131 PetriNetUnfolder]: For 43034/43036 co-relation queries the response was YES. [2022-12-06 07:32:36,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72156 conditions, 21973 events. 16708/21973 cut-off events. For 43034/43036 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 119684 event pairs, 4553 based on Foata normal form. 4/18968 useless extension candidates. Maximal degree in co-relation 67868. Up to 10618 conditions per place. [2022-12-06 07:32:36,341 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 149 selfloop transitions, 24 changer transitions 9/187 dead transitions. [2022-12-06 07:32:36,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 187 transitions, 1585 flow [2022-12-06 07:32:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:32:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:32:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2022-12-06 07:32:36,343 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46616541353383456 [2022-12-06 07:32:36,343 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 838 flow. Second operand 7 states and 124 transitions. [2022-12-06 07:32:36,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 187 transitions, 1585 flow [2022-12-06 07:32:36,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 187 transitions, 1555 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-06 07:32:36,474 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 913 flow [2022-12-06 07:32:36,475 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=913, PETRI_PLACES=84, PETRI_TRANSITIONS=119} [2022-12-06 07:32:36,475 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2022-12-06 07:32:36,475 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:36,475 INFO L89 Accepts]: Start accepts. Operand has 84 places, 119 transitions, 913 flow [2022-12-06 07:32:36,489 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:36,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:36,489 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 119 transitions, 913 flow [2022-12-06 07:32:36,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 119 transitions, 913 flow [2022-12-06 07:32:36,550 INFO L130 PetriNetUnfolder]: 263/809 cut-off events. [2022-12-06 07:32:36,550 INFO L131 PetriNetUnfolder]: For 1651/1665 co-relation queries the response was YES. [2022-12-06 07:32:36,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 809 events. 263/809 cut-off events. For 1651/1665 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5451 event pairs, 17 based on Foata normal form. 5/793 useless extension candidates. Maximal degree in co-relation 2397. Up to 172 conditions per place. [2022-12-06 07:32:36,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 119 transitions, 913 flow [2022-12-06 07:32:36,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 1972 [2022-12-06 07:32:42,508 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:42,508 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6033 [2022-12-06 07:32:42,509 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 919 flow [2022-12-06 07:32:42,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.473684210526316) internal successors, (142), 19 states have internal predecessors, (142), 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 07:32:42,509 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:42,509 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:42,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:32:42,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:42,714 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 2 more)] === [2022-12-06 07:32:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:42,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1972099819, now seen corresponding path program 1 times [2022-12-06 07:32:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:42,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400615729] [2022-12-06 07:32:42,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:42,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:43,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400615729] [2022-12-06 07:32:43,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400615729] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:32:43,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583386799] [2022-12-06 07:32:43,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:43,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:43,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:32:43,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:32:43,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:32:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:43,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:32:43,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:32:43,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:32:43,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:32:43,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 07:32:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:43,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:32:43,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:32:43,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2022-12-06 07:32:43,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-12-06 07:32:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:43,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583386799] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:32:43,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:32:43,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:32:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737956564] [2022-12-06 07:32:43,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:32:43,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:32:43,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:32:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=162, Unknown=3, NotChecked=0, Total=210 [2022-12-06 07:32:43,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 07:32:43,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 119 transitions, 919 flow. Second operand has 15 states, 15 states have (on average 7.666666666666667) internal successors, (115), 15 states have internal predecessors, (115), 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 07:32:43,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:43,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 07:32:43,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:47,352 INFO L130 PetriNetUnfolder]: 28364/37199 cut-off events. [2022-12-06 07:32:47,352 INFO L131 PetriNetUnfolder]: For 80283/80287 co-relation queries the response was YES. [2022-12-06 07:32:47,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125696 conditions, 37199 events. 28364/37199 cut-off events. For 80283/80287 co-relation queries the response was YES. Maximal size of possible extension queue 1924. Compared 216191 event pairs, 6371 based on Foata normal form. 72/32112 useless extension candidates. Maximal degree in co-relation 112421. Up to 19747 conditions per place. [2022-12-06 07:32:47,547 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 199 selfloop transitions, 89 changer transitions 13/306 dead transitions. [2022-12-06 07:32:47,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 306 transitions, 2626 flow [2022-12-06 07:32:47,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:32:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:32:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2022-12-06 07:32:47,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2022-12-06 07:32:47,549 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 919 flow. Second operand 11 states and 208 transitions. [2022-12-06 07:32:47,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 306 transitions, 2626 flow [2022-12-06 07:32:47,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 306 transitions, 2552 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-06 07:32:47,890 INFO L231 Difference]: Finished difference. Result has 94 places, 186 transitions, 1744 flow [2022-12-06 07:32:47,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1744, PETRI_PLACES=94, PETRI_TRANSITIONS=186} [2022-12-06 07:32:47,891 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 52 predicate places. [2022-12-06 07:32:47,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:47,891 INFO L89 Accepts]: Start accepts. Operand has 94 places, 186 transitions, 1744 flow [2022-12-06 07:32:47,893 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:47,893 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:47,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 186 transitions, 1744 flow [2022-12-06 07:32:47,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 186 transitions, 1744 flow [2022-12-06 07:32:47,990 INFO L130 PetriNetUnfolder]: 430/1344 cut-off events. [2022-12-06 07:32:47,990 INFO L131 PetriNetUnfolder]: For 3684/3732 co-relation queries the response was YES. [2022-12-06 07:32:47,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4567 conditions, 1344 events. 430/1344 cut-off events. For 3684/3732 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10542 event pairs, 31 based on Foata normal form. 17/1330 useless extension candidates. Maximal degree in co-relation 4377. Up to 271 conditions per place. [2022-12-06 07:32:48,005 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 186 transitions, 1744 flow [2022-12-06 07:32:48,005 INFO L188 LiptonReduction]: Number of co-enabled transitions 3368 [2022-12-06 07:32:48,006 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 07:32:48,091 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:32:48,092 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 201 [2022-12-06 07:32:48,092 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 186 transitions, 1748 flow [2022-12-06 07:32:48,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.666666666666667) internal successors, (115), 15 states have internal predecessors, (115), 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 07:32:48,092 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:48,092 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:48,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:32:48,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:48,297 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 2 more)] === [2022-12-06 07:32:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash 414610100, now seen corresponding path program 1 times [2022-12-06 07:32:48,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:48,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098901172] [2022-12-06 07:32:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:48,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:49,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098901172] [2022-12-06 07:32:49,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098901172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:32:49,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122110911] [2022-12-06 07:32:49,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:49,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:49,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:32:49,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:32:49,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:32:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:49,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:32:49,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:32:49,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:32:49,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:32:49,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 07:32:49,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:49,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:32:49,680 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_422) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-12-06 07:32:49,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:32:49,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2022-12-06 07:32:49,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-12-06 07:32:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 07:32:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122110911] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:32:49,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:32:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2022-12-06 07:32:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555307519] [2022-12-06 07:32:49,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:32:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:32:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:32:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2022-12-06 07:32:49,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 07:32:49,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 186 transitions, 1748 flow. Second operand has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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 07:32:49,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:49,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 07:32:49,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:32:54,555 INFO L130 PetriNetUnfolder]: 34422/45201 cut-off events. [2022-12-06 07:32:54,555 INFO L131 PetriNetUnfolder]: For 138636/138636 co-relation queries the response was YES. [2022-12-06 07:32:54,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163696 conditions, 45201 events. 34422/45201 cut-off events. For 138636/138636 co-relation queries the response was YES. Maximal size of possible extension queue 2348. Compared 268343 event pairs, 9501 based on Foata normal form. 2/38977 useless extension candidates. Maximal degree in co-relation 157899. Up to 27438 conditions per place. [2022-12-06 07:32:54,852 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 197 selfloop transitions, 85 changer transitions 6/293 dead transitions. [2022-12-06 07:32:54,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 293 transitions, 3011 flow [2022-12-06 07:32:54,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 07:32:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 07:32:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-06 07:32:54,854 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2022-12-06 07:32:54,854 INFO L175 Difference]: Start difference. First operand has 93 places, 186 transitions, 1748 flow. Second operand 7 states and 143 transitions. [2022-12-06 07:32:54,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 293 transitions, 3011 flow [2022-12-06 07:32:55,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 293 transitions, 2969 flow, removed 21 selfloop flow, removed 1 redundant places. [2022-12-06 07:32:55,573 INFO L231 Difference]: Finished difference. Result has 100 places, 213 transitions, 2269 flow [2022-12-06 07:32:55,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2269, PETRI_PLACES=100, PETRI_TRANSITIONS=213} [2022-12-06 07:32:55,574 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2022-12-06 07:32:55,574 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:32:55,574 INFO L89 Accepts]: Start accepts. Operand has 100 places, 213 transitions, 2269 flow [2022-12-06 07:32:55,576 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:32:55,576 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:32:55,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 213 transitions, 2269 flow [2022-12-06 07:32:55,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 213 transitions, 2269 flow [2022-12-06 07:32:55,699 INFO L130 PetriNetUnfolder]: 498/1635 cut-off events. [2022-12-06 07:32:55,699 INFO L131 PetriNetUnfolder]: For 5312/5352 co-relation queries the response was YES. [2022-12-06 07:32:55,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 1635 events. 498/1635 cut-off events. For 5312/5352 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13749 event pairs, 37 based on Foata normal form. 13/1611 useless extension candidates. Maximal degree in co-relation 5522. Up to 317 conditions per place. [2022-12-06 07:32:55,719 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 213 transitions, 2269 flow [2022-12-06 07:32:55,720 INFO L188 LiptonReduction]: Number of co-enabled transitions 3970 [2022-12-06 07:32:55,727 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:32:55,727 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 07:32:55,727 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 213 transitions, 2269 flow [2022-12-06 07:32:55,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.125) internal successors, (114), 16 states have internal predecessors, (114), 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 07:32:55,728 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:32:55,728 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:32:55,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:32:55,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:55,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:32:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:32:55,933 INFO L85 PathProgramCache]: Analyzing trace with hash -923831064, now seen corresponding path program 2 times [2022-12-06 07:32:55,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:32:55,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186835068] [2022-12-06 07:32:55,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:32:55,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:32:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:32:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:56,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:32:56,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186835068] [2022-12-06 07:32:56,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186835068] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:32:56,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770755188] [2022-12-06 07:32:56,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:32:56,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:32:56,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:32:56,962 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:32:56,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:32:57,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:32:57,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:32:57,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 07:32:57,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:32:57,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:32:57,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:32:57,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:32:57,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:32:57,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 07:32:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:57,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:32:57,378 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (< 0 (+ c_~total~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_500) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset))))) is different from false [2022-12-06 07:32:59,434 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:32:59,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 84 [2022-12-06 07:32:59,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2022-12-06 07:32:59,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-06 07:32:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:32:59,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770755188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:32:59,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:32:59,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 07:32:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741643497] [2022-12-06 07:32:59,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:32:59,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 07:32:59,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:32:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 07:32:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=221, Unknown=3, NotChecked=30, Total=306 [2022-12-06 07:32:59,542 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 40 [2022-12-06 07:32:59,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 213 transitions, 2269 flow. Second operand has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 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 07:32:59,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:32:59,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 40 [2022-12-06 07:32:59,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:06,632 INFO L130 PetriNetUnfolder]: 48184/63237 cut-off events. [2022-12-06 07:33:06,632 INFO L131 PetriNetUnfolder]: For 245434/245494 co-relation queries the response was YES. [2022-12-06 07:33:06,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242546 conditions, 63237 events. 48184/63237 cut-off events. For 245434/245494 co-relation queries the response was YES. Maximal size of possible extension queue 3256. Compared 391342 event pairs, 10655 based on Foata normal form. 62/54577 useless extension candidates. Maximal degree in co-relation 236399. Up to 24476 conditions per place. [2022-12-06 07:33:07,039 INFO L137 encePairwiseOnDemand]: 27/40 looper letters, 247 selfloop transitions, 178 changer transitions 11/441 dead transitions. [2022-12-06 07:33:07,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 441 transitions, 4997 flow [2022-12-06 07:33:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:33:07,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:33:07,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2022-12-06 07:33:07,043 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54 [2022-12-06 07:33:07,043 INFO L175 Difference]: Start difference. First operand has 100 places, 213 transitions, 2269 flow. Second operand 10 states and 216 transitions. [2022-12-06 07:33:07,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 441 transitions, 4997 flow [2022-12-06 07:33:09,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 441 transitions, 4866 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 07:33:09,146 INFO L231 Difference]: Finished difference. Result has 111 places, 298 transitions, 3885 flow [2022-12-06 07:33:09,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2193, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3885, PETRI_PLACES=111, PETRI_TRANSITIONS=298} [2022-12-06 07:33:09,148 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2022-12-06 07:33:09,148 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:33:09,149 INFO L89 Accepts]: Start accepts. Operand has 111 places, 298 transitions, 3885 flow [2022-12-06 07:33:09,151 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:33:09,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:33:09,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 298 transitions, 3885 flow [2022-12-06 07:33:09,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 298 transitions, 3885 flow [2022-12-06 07:33:09,434 INFO L130 PetriNetUnfolder]: 732/2398 cut-off events. [2022-12-06 07:33:09,434 INFO L131 PetriNetUnfolder]: For 12766/12838 co-relation queries the response was YES. [2022-12-06 07:33:09,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9392 conditions, 2398 events. 732/2398 cut-off events. For 12766/12838 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22021 event pairs, 56 based on Foata normal form. 25/2360 useless extension candidates. Maximal degree in co-relation 9184. Up to 465 conditions per place. [2022-12-06 07:33:09,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 298 transitions, 3885 flow [2022-12-06 07:33:09,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 5692 [2022-12-06 07:33:12,112 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:33:12,113 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2965 [2022-12-06 07:33:12,113 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 298 transitions, 3886 flow [2022-12-06 07:33:12,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 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 07:33:12,113 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:33:12,113 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:33:12,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:33:12,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:12,318 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 07:33:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:33:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash -136415937, now seen corresponding path program 1 times [2022-12-06 07:33:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:33:12,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360106957] [2022-12-06 07:33:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:33:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:33:13,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360106957] [2022-12-06 07:33:13,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360106957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:33:13,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112445441] [2022-12-06 07:33:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:33:13,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:33:13,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:33:13,362 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:33:13,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:33:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:33:13,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 07:33:13,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:33:13,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:33:13,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-12-06 07:33:13,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:33:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:13,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:33:14,027 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-06 07:33:14,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2022-12-06 07:33:14,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-12-06 07:33:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:33:14,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112445441] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:33:14,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:33:14,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-06 07:33:14,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456132359] [2022-12-06 07:33:14,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:33:14,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:33:14,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:33:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:33:14,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=464, Unknown=1, NotChecked=0, Total=552 [2022-12-06 07:33:14,205 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 41 [2022-12-06 07:33:14,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 298 transitions, 3886 flow. Second operand has 24 states, 24 states have (on average 5.708333333333333) internal successors, (137), 24 states have internal predecessors, (137), 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 07:33:14,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:33:14,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 41 [2022-12-06 07:33:14,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:33:20,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:33:42,762 INFO L130 PetriNetUnfolder]: 138832/183360 cut-off events. [2022-12-06 07:33:42,763 INFO L131 PetriNetUnfolder]: For 917754/917936 co-relation queries the response was YES. [2022-12-06 07:33:43,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747023 conditions, 183360 events. 138832/183360 cut-off events. For 917754/917936 co-relation queries the response was YES. Maximal size of possible extension queue 9325. Compared 1285412 event pairs, 10076 based on Foata normal form. 555/158515 useless extension candidates. Maximal degree in co-relation 729111. Up to 35644 conditions per place. [2022-12-06 07:33:44,534 INFO L137 encePairwiseOnDemand]: 12/41 looper letters, 910 selfloop transitions, 960 changer transitions 61/1934 dead transitions. [2022-12-06 07:33:44,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1934 transitions, 21405 flow [2022-12-06 07:33:44,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-12-06 07:33:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-12-06 07:33:44,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 1211 transitions. [2022-12-06 07:33:44,558 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4615091463414634 [2022-12-06 07:33:44,558 INFO L175 Difference]: Start difference. First operand has 111 places, 298 transitions, 3886 flow. Second operand 64 states and 1211 transitions. [2022-12-06 07:33:44,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1934 transitions, 21405 flow [2022-12-06 07:34:01,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1934 transitions, 20540 flow, removed 133 selfloop flow, removed 3 redundant places. [2022-12-06 07:34:01,115 INFO L231 Difference]: Finished difference. Result has 201 places, 1123 transitions, 17293 flow [2022-12-06 07:34:01,116 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3605, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=17293, PETRI_PLACES=201, PETRI_TRANSITIONS=1123} [2022-12-06 07:34:01,116 INFO L294 CegarLoopForPetriNet]: 42 programPoint places, 159 predicate places. [2022-12-06 07:34:01,116 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:34:01,116 INFO L89 Accepts]: Start accepts. Operand has 201 places, 1123 transitions, 17293 flow [2022-12-06 07:34:01,120 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:34:01,120 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:34:01,120 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 1123 transitions, 17293 flow [2022-12-06 07:34:01,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 1123 transitions, 17293 flow [2022-12-06 07:34:02,728 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([818] thread3EXIT-->L146-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem36#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem36#1=|v_ULTIMATE.start_main_#t~mem36#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][1119], [Black: 624#(and (or (< 0 (+ ~total~0 1)) (< ~n1~0 1)) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))), Black: 434#(<= 1 ~total~0), Black: 618#(and (or (not (< ~q1_back~0 ~n1~0)) (and (< 0 (+ ~total~0 ~C~0)) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (not (<= 0 ~q1_back~0))) (or (< 0 (+ ~total~0 1)) (< ~n1~0 1))), Black: 562#(< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))), Black: 446#(and (<= 0 ~total~0) (< 0 ~C~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (= ~q1_back~0 ~q1_front~0)), Black: 848#(and (or (<= ~q1_back~0 ~q1_front~0) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (and (<= 0 ~q1~0.offset) (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t4~0#1.base|))), Black: 1024#(and (= ~total~0 0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 ~q1_front~0) (<= 1 ~C~0)), Black: 1028#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1026#(and (or (= ~total~0 0) (<= ~q1_back~0 ~q1_front~0) (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0)) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 849#(or (<= ~q1_back~0 ~q1_front~0) (and (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (and (<= 0 ~q1~0.offset) (<= (+ ~q1~0.offset (* ~q1_front~0 4) 1) 0))), 419#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (not (< ~i~0 ~N~0)))), 1587#(or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))))), Black: 1424#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (= (* ~q1_front~0 4) 4) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))), Black: 1268#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~total~0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1422#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (and (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (= (* ~q1_back~0 4) 4)) (<= ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (<= ~q1_back~0 0) (and (= (* ~q1_front~0 4) 4) (<= ~C~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= ~q1_back~0 ~q1_front~0) (= (* ~q1_front~0 4) 4) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1429#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1~0.offset 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1418#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~total~0 0) (or (and (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (= (* ~q1_back~0 4) 4)) (<= ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (<= ~n1~0 ~q1_back~0) (<= ~q1_back~0 0) (and (= (* ~q1_front~0 4) 4) (<= ~C~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (= ~q1~0.offset 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), 428#true, 99#thread4EXITtrue, Black: 408#(or (< ~q1_front~0 (+ ~q1_back~0 1)) (not (< ~i~0 ~N~0))), Black: 421#(and (or (< ~q1_front~0 (+ ~q1_back~0 1)) (= (mod |thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (not (< ~i~0 ~N~0)))), Black: 423#(and (< ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), Black: 840#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~n1~0 1) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (forall ((v_ArrVal_268 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_268) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))) (not (<= 0 ~q1_front~0)) (not (< ~q1_front~0 ~n1~0)))), Black: 1628#(and (or (<= ~n1~0 ~q1_front~0) (and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (<= ~q1_back~0 0)) (or (not (<= ~q1_front~0 0)) (and (<= 0 ~q1~0.offset) (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (= ~total~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (or (<= ~q1_front~0 0) (and (or (< (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) 12) (not (= (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| (- 8))) ~C~0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)) (<= (* |ULTIMATE.start_create_fresh_int_array_~i~1#1| 4) 12))) (or (not (<= ~q1_front~0 0)) (and (<= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (<= 0 |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| (+ ~q1_back~0 1))) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|)), 187#L146-2true, Black: 1725#(and (or (not (< ~q1_front~0 ~q1_back~0)) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (<= 1 ~total~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1690#(and (<= 1 ~total~0) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 ~q1_front~0) (or (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1))), Black: 1228#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~q1~0.offset 0)), Black: 1444#(<= 1 ~total~0), Black: 1225#(and (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~total~0 0) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 0))) (<= 0 ~total~0) (or (<= ~q1_front~0 0) (and (= ~total~0 0) (= (* ~q1_front~0 4) 4))) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0)), Black: 1563#(or (<= 1 ~total~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), Black: 1731#(and (<= 1 ~total~0) (or (not (< ~q1_front~0 ~q1_back~0)) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1670#(and (or (<= ~n1~0 ~q1_front~0) (and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (<= ~q1_back~0 0)) (or (not (<= ~q1_front~0 0)) (and (<= 0 ~q1~0.offset) (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (or (not (< ~q1_front~0 (+ ~q1_back~0 1))) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0) (not (<= 0 ~q1_front~0))) (= ~total~0 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (and (<= 0 ~q1~0.offset) (<= (+ ~q1_front~0 1) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1699#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1709#(and (<= 1 ~total~0) (or (not (< ~q1_front~0 (+ ~q1_back~0 1))) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0) (not (<= 0 ~q1_front~0))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1))), Black: 1656#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1646#(and (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (and (<= 0 ~q1~0.offset) (<= (+ ~q1_front~0 1) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1634#(and (or (<= ~n1~0 ~q1_front~0) (and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (<= ~q1_back~0 0)) (or (not (<= ~q1_front~0 0)) (and (<= 0 ~q1~0.offset) (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (= ~total~0 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|))), Black: 1701#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 ~total~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0)))), Black: 1735#(and (<= 1 ~total~0) (or (not (< ~q1_front~0 ~q1_back~0)) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))), Black: 1733#(and (or (<= 1 ~total~0) (not (<= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0))) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1652#(and (or (not (< ~q1_front~0 (+ ~q1_back~0 1))) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0) (not (<= 0 ~q1_front~0))) (<= 0 ~total~0) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1632#(and (= ~total~0 0) (<= 1 ~N~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (< ~i~0 ~N~0) (= ~q1_back~0 ~q1_front~0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= 1 ~C~0)), Black: 1719#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1))), Black: 1650#(and (or (not (< ~q1_front~0 (+ ~q1_back~0 1))) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0) (not (<= 0 ~q1_front~0))) (<= 0 ~total~0) (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1686#(and (or (<= 1 ~total~0) (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1672#(and (<= 1 ~total~0) (<= 1 ~q1_back~0) (<= 1 ~N~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (= ~q1_back~0 ~q1_front~0) (or (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1729#(and (<= 1 ~total~0) (or (not (< ~q1_front~0 (+ ~q1_back~0 1))) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0) (not (<= 0 ~q1_front~0))) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1721#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (= |thread3Thread1of1ForFork1_~cond~2#1| 0) (= |thread3Thread1of1ForFork1_~cond~2#1| 1)) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 1435#true, Black: 1644#(and (or (<= ~n1~0 ~q1_front~0) (and (or (not (= (select (select |#memory_int| ~q1~0.base) (+ (* ~q1_back~0 4) ~q1~0.offset)) ~C~0)) (not (= (+ ~q1~0.offset (* ~q1_front~0 4)) 4)) (<= ~q1_back~0 0)) (or (not (<= ~q1_front~0 0)) (and (<= 0 ~q1~0.offset) (<= (+ (* ~q1_back~0 4) ~q1~0.offset 1) 0)))) (<= (+ ~q1_front~0 1) ~q1_back~0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (or (not (< ~q1_front~0 (+ ~q1_back~0 1))) (< 0 (+ ~total~0 ~C~0)) (< ~q1_front~0 ~q1_back~0) (not (<= 0 ~q1_front~0))) (= ~total~0 0) (not (= ~q1~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~q1~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (not (= ~q1~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (and (<= 0 ~q1~0.offset) (<= (+ ~q1_front~0 1) 0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1678#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 227#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1664#(and (<= 0 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (not (< ~q1_front~0 ~q1_back~0)) (< (+ ~q1_front~0 1) ~q1_back~0) (< ~i~0 ~N~0) (not (<= 0 ~q1_front~0)) (= (mod |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (forall ((v_ArrVal_569 (Array Int Int))) (< 0 (+ ~total~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_569) ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))))))), Black: 229#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 ~N~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 1705#(and (<= 1 ~total~0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|)), Black: 1654#(and (= ~total~0 0) (<= (+ ~q1~0.base 2) |ULTIMATE.start_main_~#t4~0#1.base|) (or (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (and (<= 0 ~q1~0.offset) (<= (+ ~q1_front~0 1) 0)))), Black: 226#(and (= ~i~0 0) (<= 1 ~N~0)), 844#true, Black: 620#(and (<= 0 ~total~0) (<= 0 ~q1_front~0) (<= ~q1_front~0 0) (<= 1 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (= ~q1~0.offset 0) (<= ~n1~0 1) (<= 1 (+ ~total~0 ~C~0))), Black: 630#(and (<= 1 ~total~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q1~0.offset 0) (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (<= ~n1~0 1) (or (not (< ~q1_back~0 ~n1~0)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (not (<= 0 ~q1_back~0))) (<= 1 (+ ~total~0 ~C~0))), Black: 626#(and (<= 0 ~total~0) (< 0 (+ ~total~0 (select (select |#memory_int| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))))) (= ~q1~0.offset 0) (or (<= (+ (* ~q1_back~0 4) ~q1~0.offset) 4) (<= (+ ~q1~0.offset (* ~q1_front~0 4)) 0)) (<= ~n1~0 1) (or (not (< ~q1_back~0 ~n1~0)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (not (<= 0 ~q1_back~0))) (<= 1 (+ ~total~0 ~C~0))), Black: 628#(and (<= 1 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (not (< ~q1_back~0 ~n1~0)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (not (<= 0 ~q1_back~0))) (<= 1 (+ ~total~0 ~C~0))), Black: 622#(and (<= 0 ~total~0) (= ~q1~0.offset 0) (<= ~n1~0 1) (or (not (< ~q1_back~0 ~n1~0)) (= (* ~q1_back~0 4) (* ~q1_front~0 4)) (not (<= 0 ~q1_back~0))) (<= 1 (+ ~total~0 ~C~0)))]) [2022-12-06 07:34:02,729 INFO L382 tUnfolder$Statistics]: this new event has 26 ancestors and is not cut-off event [2022-12-06 07:34:02,729 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2022-12-06 07:34:02,729 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is not cut-off event [2022-12-06 07:34:02,729 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2022-12-06 07:34:02,793 INFO L130 PetriNetUnfolder]: 6392/16073 cut-off events. [2022-12-06 07:34:02,794 INFO L131 PetriNetUnfolder]: For 60807/62108 co-relation queries the response was YES. [2022-12-06 07:34:02,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53555 conditions, 16073 events. 6392/16073 cut-off events. For 60807/62108 co-relation queries the response was YES. Maximal size of possible extension queue 1741. Compared 190629 event pairs, 2237 based on Foata normal form. 95/13112 useless extension candidates. Maximal degree in co-relation 53324. Up to 4763 conditions per place. [2022-12-06 07:34:03,353 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 1123 transitions, 17293 flow [2022-12-06 07:34:03,353 INFO L188 LiptonReduction]: Number of co-enabled transitions 21448 [2022-12-06 07:34:03,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 07:34:03,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [1009] L113-->L110: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork3_plus_~a#1_11| |v_thread4Thread1of1ForFork3_plus_~b#1_11|))) (and (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_11| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_11| 2147483648)) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_11| 2147483647) (= .cse0 |v_thread4Thread1of1ForFork3_plus_#res#1_11|) (= (select (select |v_#memory_int_193| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_front~0_113 4))) |v_thread4Thread1of1ForFork3_plus_#in~b#1_11|) (= |v_thread4Thread1of1ForFork3_plus_#in~a#1_11| v_~total~0_98) (= v_~q2_front~0_112 (+ v_~q2_front~0_113 1)) (= |v_thread4Thread1of1ForFork3_plus_#in~b#1_11| |v_thread4Thread1of1ForFork3_plus_~b#1_11|) (not (= (ite (and (< v_~q2_front~0_113 v_~n2~0_90) (< v_~q2_front~0_113 v_~q2_back~0_137) (<= 0 v_~q2_front~0_113)) 1 0) 0)) (= (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork3_plus_~b#1_11| 0)) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|) (not (= (mod |v_thread4Thread1of1ForFork3_~cond~3#1_15| 256) 0)) (= |v_thread4Thread1of1ForFork3_plus_#in~a#1_11| |v_thread4Thread1of1ForFork3_plus_~a#1_11|) (= v_~total~0_97 |v_thread4Thread1of1ForFork3_plus_#res#1_11|))) InVars {~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_193|, ~q2_front~0=v_~q2_front~0_113, ~q2~0.base=v_~q2~0.base_65, thread4Thread1of1ForFork3_~cond~3#1=|v_thread4Thread1of1ForFork3_~cond~3#1_15|, ~q2_back~0=v_~q2_back~0_137, ~total~0=v_~total~0_98} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_11|, ~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_65, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_11|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|, thread4Thread1of1ForFork3_#t~ret13#1=|v_thread4Thread1of1ForFork3_#t~ret13#1_11|, ~q2_front~0=v_~q2_front~0_112, thread4Thread1of1ForFork3_~cond~3#1=|v_thread4Thread1of1ForFork3_~cond~3#1_15|, thread4Thread1of1ForFork3_#t~mem12#1=|v_thread4Thread1of1ForFork3_#t~mem12#1_11|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_11|, ~total~0=v_~total~0_97, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_11|, #memory_int=|v_#memory_int_193|, thread4Thread1of1ForFork3_#t~post14#1=|v_thread4Thread1of1ForFork3_#t~post14#1_11|, ~q2~0.base=v_~q2~0.base_65, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_11|, ~q2_back~0=v_~q2_back~0_137, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_11|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#t~post14#1, thread4Thread1of1ForFork3_#t~ret13#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~mem12#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1] [2022-12-06 07:34:03,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L95: Formula: (= (ite (= (ite (or (< v_~i~0_6 v_~N~0_4) (< v_~q1_front~0_4 v_~q1_back~0_6)) 1 0) 0) 0 1) |v_thread3Thread1of1ForFork1_~cond~2#1_1|) InVars {~N~0=v_~N~0_4, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} OutVars{~N~0=v_~N~0_4, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_1|, ~q1_front~0=v_~q1_front~0_4, ~i~0=v_~i~0_6, ~q1_back~0=v_~q1_back~0_6} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_~cond~2#1] and [1009] L113-->L110: Formula: (let ((.cse0 (+ |v_thread4Thread1of1ForFork3_plus_~a#1_11| |v_thread4Thread1of1ForFork3_plus_~b#1_11|))) (and (= |v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_11| |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|) (<= 0 (+ |v_thread4Thread1of1ForFork3_plus_#res#1_11| 2147483648)) (<= |v_thread4Thread1of1ForFork3_plus_#res#1_11| 2147483647) (= .cse0 |v_thread4Thread1of1ForFork3_plus_#res#1_11|) (= (select (select |v_#memory_int_193| v_~q2~0.base_65) (+ v_~q2~0.offset_65 (* v_~q2_front~0_113 4))) |v_thread4Thread1of1ForFork3_plus_#in~b#1_11|) (= |v_thread4Thread1of1ForFork3_plus_#in~a#1_11| v_~total~0_98) (= v_~q2_front~0_112 (+ v_~q2_front~0_113 1)) (= |v_thread4Thread1of1ForFork3_plus_#in~b#1_11| |v_thread4Thread1of1ForFork3_plus_~b#1_11|) (not (= (ite (and (< v_~q2_front~0_113 v_~n2~0_90) (< v_~q2_front~0_113 v_~q2_back~0_137) (<= 0 v_~q2_front~0_113)) 1 0) 0)) (= (ite (or (<= .cse0 2147483647) (<= |v_thread4Thread1of1ForFork3_plus_~b#1_11| 0)) 1 0) |v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|) (not (= (mod |v_thread4Thread1of1ForFork3_~cond~3#1_15| 256) 0)) (= |v_thread4Thread1of1ForFork3_plus_#in~a#1_11| |v_thread4Thread1of1ForFork3_plus_~a#1_11|) (= v_~total~0_97 |v_thread4Thread1of1ForFork3_plus_#res#1_11|))) InVars {~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_65, #memory_int=|v_#memory_int_193|, ~q2_front~0=v_~q2_front~0_113, ~q2~0.base=v_~q2~0.base_65, thread4Thread1of1ForFork3_~cond~3#1=|v_thread4Thread1of1ForFork3_~cond~3#1_15|, ~q2_back~0=v_~q2_back~0_137, ~total~0=v_~total~0_98} OutVars{thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1_11|, ~n2~0=v_~n2~0_90, ~q2~0.offset=v_~q2~0.offset_65, thread4Thread1of1ForFork3_plus_#in~b#1=|v_thread4Thread1of1ForFork3_plus_#in~b#1_11|, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_11|, thread4Thread1of1ForFork3_#t~ret13#1=|v_thread4Thread1of1ForFork3_#t~ret13#1_11|, ~q2_front~0=v_~q2_front~0_112, thread4Thread1of1ForFork3_~cond~3#1=|v_thread4Thread1of1ForFork3_~cond~3#1_15|, thread4Thread1of1ForFork3_#t~mem12#1=|v_thread4Thread1of1ForFork3_#t~mem12#1_11|, thread4Thread1of1ForFork3_plus_~b#1=|v_thread4Thread1of1ForFork3_plus_~b#1_11|, ~total~0=v_~total~0_97, thread4Thread1of1ForFork3_plus_#in~a#1=|v_thread4Thread1of1ForFork3_plus_#in~a#1_11|, #memory_int=|v_#memory_int_193|, thread4Thread1of1ForFork3_#t~post14#1=|v_thread4Thread1of1ForFork3_#t~post14#1_11|, ~q2~0.base=v_~q2~0.base_65, thread4Thread1of1ForFork3_plus_#res#1=|v_thread4Thread1of1ForFork3_plus_#res#1_11|, ~q2_back~0=v_~q2_back~0_137, thread4Thread1of1ForFork3_plus_~a#1=|v_thread4Thread1of1ForFork3_plus_~a#1_11|} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork3_plus_#in~b#1, thread4Thread1of1ForFork3_plus_#in~a#1, thread4Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork3_#t~post14#1, thread4Thread1of1ForFork3_#t~ret13#1, ~q2_front~0, thread4Thread1of1ForFork3_plus_#res#1, thread4Thread1of1ForFork3_#t~mem12#1, thread4Thread1of1ForFork3_plus_~b#1, ~total~0, thread4Thread1of1ForFork3_plus_~a#1] [2022-12-06 07:34:04,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1013] L95-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_In_1| 256) 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_In_1|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_Out_4|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_In_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 07:34:04,150 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1013] L95-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork1_#res#1.base_Out_4| 0) (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_In_1| 256) 0)) InVars {thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_In_1|} OutVars{thread3Thread1of1ForFork1_#res#1.offset=|v_thread3Thread1of1ForFork1_#res#1.offset_Out_4|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_In_1|, thread3Thread1of1ForFork1_#res#1.base=|v_thread3Thread1of1ForFork1_#res#1.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res#1.offset, thread3Thread1of1ForFork1_#res#1.base] and [839] L59-->L59: Formula: (and (= (+ 1 v_~q1_back~0_66) v_~q1_back~0_65) (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_16| 256) 0)) (= v_~i~0_56 (+ v_~i~0_57 1)) (= (ite (= (ite (< v_~i~0_56 v_~N~0_8) 1 0) 0) 0 1) |v_thread1Thread1of1ForFork2_~cond~0#1_15|) (= (select (select |v_#memory_int_79| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_back~0_66))) v_~C~0_25) (= (ite |v_thread1_#t~short2#1_58| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|)) (<= 0 v_~q1_back~0_66) |v_thread1_#t~short2#1_57| (< v_~q1_back~0_66 v_~n1~0_22)) InVars {~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_57, ~C~0=v_~C~0_25, ~q1_back~0=v_~q1_back~0_66, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_16|} OutVars{~q1~0.offset=v_~q1~0.offset_29, ~i~0=v_~i~0_56, ~C~0=v_~C~0_25, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_9|, ~n1~0=v_~n1~0_22, ~N~0=v_~N~0_8, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_9|, ~q1_back~0=v_~q1_back~0_65, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_9|, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_79|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_9|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_9|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_15|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_11|} AuxVars[|v_thread1_#t~short2#1_58|, |v_thread1_#t~short2#1_57|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] [2022-12-06 07:34:04,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1030] $Ultimate##0-->L59: Formula: (and (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_50| 256) 0)) (not (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_26| 0)) (= |v_thread1Thread1of1ForFork2_~cond~0#1_49| (ite (= (ite (< v_~i~0_105 v_~N~0_78) 1 0) 0) 0 1)) (= (+ v_~i~0_106 1) v_~i~0_105) (< v_~q1_back~0_169 v_~n1~0_110) (= (ite |v_thread1_#t~short2#1_93| 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_26|) (= (select (select |v_#memory_int_245| v_~q1~0.base_96) (+ v_~q1~0.offset_96 (* v_~q1_back~0_169 4))) v_~C~0_110) (= (+ v_~q1_back~0_169 1) v_~q1_back~0_168) (<= 0 v_~q1_back~0_169) |v_thread1_#t~short2#1_94| (= |v_thread3Thread1of1ForFork1_~cond~2#1_49| (ite (= (ite (or (< v_~i~0_106 v_~N~0_78) (< v_~q1_front~0_150 v_~q1_back~0_169)) 1 0) 0) 0 1)) (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_26| |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_26|)) InVars {~q1~0.offset=v_~q1~0.offset_96, ~q1_front~0=v_~q1_front~0_150, ~i~0=v_~i~0_106, ~C~0=v_~C~0_110, ~q1_back~0=v_~q1_back~0_169, ~n1~0=v_~n1~0_110, ~q1~0.base=v_~q1~0.base_96, #memory_int=|v_#memory_int_245|, ~N~0=v_~N~0_78, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_50|} OutVars{~q1~0.offset=v_~q1~0.offset_96, ~q1_front~0=v_~q1_front~0_150, ~i~0=v_~i~0_105, ~C~0=v_~C~0_110, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_26|, ~n1~0=v_~n1~0_110, ~N~0=v_~N~0_78, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_49|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_26|, ~q1_back~0=v_~q1_back~0_168, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_26|, ~q1~0.base=v_~q1~0.base_96, #memory_int=|v_#memory_int_245|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_26|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_26|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_49|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_28|} AuxVars[|v_thread1_#t~short2#1_94|, |v_thread1_#t~short2#1_93|] AssignedVars[thread1Thread1of1ForFork2_#t~post3#1, ~i~0, thread1Thread1of1ForFork2_#t~short2#1, ~q1_back~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, thread3Thread1of1ForFork1_~cond~2#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1, thread1Thread1of1ForFork2_#t~mem1#1] and [891] L95-->L92: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork1_plus_~a#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|))) (and (= v_~total~0_60 |v_thread3Thread1of1ForFork1_plus_#in~a#1_5|) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_~b#1_5| 0)) 1 0)) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_5| 2147483648)) (= (+ v_~q1_front~0_49 1) v_~q1_front~0_48) (= |v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= .cse0 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_5| 2147483647) (= |v_thread3Thread1of1ForFork1_plus_#in~a#1_5| |v_thread3Thread1of1ForFork1_plus_~a#1_5|) (= (select (select |v_#memory_int_97| v_~q1~0.base_33) (+ v_~q1~0.offset_33 (* 4 v_~q1_front~0_49))) |v_thread3Thread1of1ForFork1_plus_#in~b#1_5|) (not (= (ite (and (<= 0 v_~q1_front~0_49) (< v_~q1_front~0_49 v_~q1_back~0_71) (< v_~q1_front~0_49 v_~n1~0_32)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#in~b#1_5| |v_thread3Thread1of1ForFork1_plus_~b#1_5|) (= v_~total~0_59 |v_thread3Thread1of1ForFork1_plus_#res#1_5|) (not (= (mod |v_thread3Thread1of1ForFork1_~cond~2#1_13| 256) 0)))) InVars {~q1~0.offset=v_~q1~0.offset_33, ~q1_front~0=v_~q1_front~0_49, ~q1_back~0=v_~q1_back~0_71, ~n1~0=v_~n1~0_32, ~q1~0.base=v_~q1~0.base_33, #memory_int=|v_#memory_int_97|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_13|, ~total~0=v_~total~0_60} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~q1~0.offset=v_~q1~0.offset_33, ~q1_front~0=v_~q1_front~0_48, ~n1~0=v_~n1~0_32, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_5|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_5|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_5|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_5|, thread3Thread1of1ForFork1_~cond~2#1=|v_thread3Thread1of1ForFork1_~cond~2#1_13|, ~total~0=v_~total~0_59, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_5|, ~q1_back~0=v_~q1_back~0_71, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_5|, ~q1~0.base=v_~q1~0.base_33, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_5|, #memory_int=|v_#memory_int_97|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_5|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0] [2022-12-06 07:34:05,206 WARN L322 ript$VariableManager]: TermVariable LBE521 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:05,207 WARN L322 ript$VariableManager]: TermVariable LBE506 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:05,207 WARN L322 ript$VariableManager]: TermVariable LBE17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:05,207 WARN L322 ript$VariableManager]: TermVariable LBE27 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:34:05,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:34:05,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:34:05,413 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1_#t~short2#1_95 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) 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 07:34:05,428 INFO L158 Benchmark]: Toolchain (without parser) took 116312.10ms. Allocated memory was 181.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 156.9MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 07:34:05,428 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 181.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:34:05,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.59ms. Allocated memory is still 181.4MB. Free memory was 156.9MB in the beginning and 141.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 07:34:05,429 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.41ms. Allocated memory is still 181.4MB. Free memory was 141.1MB in the beginning and 138.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:34:05,429 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 181.4MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:34:05,429 INFO L158 Benchmark]: RCFGBuilder took 777.12ms. Allocated memory is still 181.4MB. Free memory was 136.5MB in the beginning and 138.9MB in the end (delta: -2.4MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. [2022-12-06 07:34:05,429 INFO L158 Benchmark]: TraceAbstraction took 115197.09ms. Allocated memory was 181.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 137.9MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 07:34:05,433 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.09ms. Allocated memory is still 181.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.59ms. Allocated memory is still 181.4MB. Free memory was 156.9MB in the beginning and 141.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.41ms. Allocated memory is still 181.4MB. Free memory was 141.1MB in the beginning and 138.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 181.4MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 777.12ms. Allocated memory is still 181.4MB. Free memory was 136.5MB in the beginning and 138.9MB in the end (delta: -2.4MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. * TraceAbstraction took 115197.09ms. Allocated memory was 181.4MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 137.9MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5s, 204 PlacesBefore, 42 PlacesAfterwards, 210 TransitionsBefore, 35 TransitionsAfterwards, 1824 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 131 TrivialYvCompositions, 31 ConcurrentYvCompositions, 13 ChoiceCompositions, 175 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 948, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 962, independent: 948, independent conditional: 0, independent unconditional: 948, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 899, independent: 890, independent conditional: 0, independent unconditional: 890, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 899, independent: 889, independent conditional: 0, independent unconditional: 889, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 962, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 899, unknown conditional: 0, unknown unconditional: 899] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1343, Positive conditional cache size: 0, Positive unconditional cache size: 1343, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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, 42 PlacesBefore, 42 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 46, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 46, independent conditional: 7, independent unconditional: 39, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, independent: 36, independent conditional: 6, independent unconditional: 30, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 12, independent conditional: 5, independent unconditional: 7, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 50, independent: 10, independent conditional: 1, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 39, unknown conditional: 6, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 36, Positive conditional cache size: 6, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 45 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 446 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 88, independent conditional: 88, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 88, independent conditional: 12, independent unconditional: 76, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 76, independent conditional: 8, independent unconditional: 68, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 48, Positive conditional cache size: 6, Positive unconditional cache size: 42, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 48, Positive conditional cache size: 6, Positive unconditional cache size: 42, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 78 PlacesBefore, 77 PlacesAfterwards, 114 TransitionsBefore, 113 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 236, independent: 216, independent conditional: 116, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, independent: 216, independent conditional: 116, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, independent: 216, independent conditional: 116, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 236, independent: 199, independent conditional: 99, independent unconditional: 100, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 17, unknown conditional: 17, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 71, Positive conditional cache size: 27, Positive unconditional cache size: 44, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 84 PlacesBefore, 84 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1972 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 260, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 104, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 260, independent conditional: 104, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 260, independent conditional: 104, independent unconditional: 156, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 286, independent: 257, independent conditional: 102, independent unconditional: 155, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 74, Positive conditional cache size: 29, Positive unconditional cache size: 45, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 93 PlacesBefore, 93 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 3368 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 1074, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 640, independent unconditional: 434, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 516, independent unconditional: 558, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1136, independent: 1074, independent conditional: 516, independent unconditional: 558, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 1136, independent: 1069, independent conditional: 512, independent unconditional: 557, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 82, Positive conditional cache size: 35, Positive unconditional cache size: 47, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 124, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 213 TransitionsBefore, 213 TransitionsAfterwards, 3970 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 897, independent: 858, independent conditional: 858, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 897, independent: 858, independent conditional: 429, independent unconditional: 429, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 897, independent: 858, independent conditional: 390, independent unconditional: 468, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 897, independent: 858, independent conditional: 390, independent unconditional: 468, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 897, independent: 857, independent conditional: 389, independent unconditional: 468, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 83, Positive conditional cache size: 36, Positive unconditional cache size: 47, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 39, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 111 PlacesBefore, 111 PlacesAfterwards, 298 TransitionsBefore, 298 TransitionsAfterwards, 5692 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 3510, independent unconditional: 0, dependent: 130, dependent conditional: 130, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 1820, independent unconditional: 1690, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 1560, independent unconditional: 1950, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3640, independent: 3510, independent conditional: 1560, independent unconditional: 1950, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 3640, independent: 3509, independent conditional: 1560, independent unconditional: 1949, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 84, Positive conditional cache size: 36, Positive unconditional cache size: 48, Negative cache size: 5, Negative conditional cache size: 1, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 260, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1_#t~short2#1_95 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1_#t~short2#1_95 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:34:05,457 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...