/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:16:36,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:16:36,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:16:36,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:16:36,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:16:36,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:16:36,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:16:36,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:16:36,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:16:36,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:16:36,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:16:36,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:16:36,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:16:36,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:16:36,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:16:36,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:16:36,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:16:36,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:16:36,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:16:36,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:16:36,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:16:36,431 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:16:36,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:16:36,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:16:36,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:16:36,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:16:36,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:16:36,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:16:36,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:16:36,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:16:36,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:16:36,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:16:36,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:16:36,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:16:36,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:16:36,453 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:16:36,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:16:36,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:16:36,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:16:36,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:16:36,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:16:36,456 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:16:36,493 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:16:36,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:16:36,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:16:36,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:16:36,495 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:16:36,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:16:36,496 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:16:36,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:16:36,496 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:16:36,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:16:36,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:16:36,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:16:36,498 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:16:36,498 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:16:36,498 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:16:36,498 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:16:36,498 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:16:36,498 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:16:36,499 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:16:36,499 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:16:36,499 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:16:36,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:16:36,499 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:16:36,499 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:16:36,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:16:36,500 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:16:36,500 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:16:36,500 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:16:36,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:16:36,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:16:36,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:16:36,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:16:36,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:16:36,866 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:16:36,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 00:16:37,993 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:16:38,224 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:16:38,226 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 00:16:38,234 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5222832b/0da730529d8f48a6af4c704cbfc79c92/FLAGce71f901b [2022-12-06 00:16:38,256 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5222832b/0da730529d8f48a6af4c704cbfc79c92 [2022-12-06 00:16:38,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:16:38,259 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:16:38,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:16:38,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:16:38,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:16:38,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fe8889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38, skipping insertion in model container [2022-12-06 00:16:38,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:16:38,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:16:38,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,424 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,448 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-12-06 00:16:38,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:16:38,468 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:16:38,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:16:38,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:16:38,495 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-12-06 00:16:38,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:16:38,514 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:16:38,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38 WrapperNode [2022-12-06 00:16:38,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:16:38,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:16:38,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:16:38,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:16:38,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,577 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-06 00:16:38,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:16:38,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:16:38,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:16:38,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:16:38,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,618 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:16:38,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:16:38,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:16:38,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:16:38,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (1/1) ... [2022-12-06 00:16:38,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:16:38,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:16:38,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:16:38,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:16:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:16:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:16:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:16:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:16:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:16:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:16:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:16:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:16:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:16:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:16:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:16:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:16:38,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:16:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:16:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:16:38,705 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:16:38,852 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:16:38,854 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:16:39,162 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:16:39,245 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:16:39,245 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 00:16:39,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:16:39 BoogieIcfgContainer [2022-12-06 00:16:39,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:16:39,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:16:39,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:16:39,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:16:39,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:16:38" (1/3) ... [2022-12-06 00:16:39,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6af386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:16:39, skipping insertion in model container [2022-12-06 00:16:39,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:16:38" (2/3) ... [2022-12-06 00:16:39,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d6af386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:16:39, skipping insertion in model container [2022-12-06 00:16:39,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:16:39" (3/3) ... [2022-12-06 00:16:39,259 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-12-06 00:16:39,278 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:16:39,278 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:16:39,278 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:16:39,376 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:16:39,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 00:16:39,519 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-06 00:16:39,519 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:16:39,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 00:16:39,526 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 00:16:39,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:39,536 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:39,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:39,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:39,627 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-06 00:16:39,628 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:16:39,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 00:16:39,633 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 00:16:39,633 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 00:16:46,307 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 00:16:46,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:16:46,328 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;@105a7baa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:16:46,328 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:16:46,338 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 00:16:46,338 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:16:46,339 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:46,339 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:46,340 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:16:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-06 00:16:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:46,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137579659] [2022-12-06 00:16:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:16:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:46,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137579659] [2022-12-06 00:16:46,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137579659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:46,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:46,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:16:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173699494] [2022-12-06 00:16:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:46,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:16:46,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:46,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:16:46,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:16:46,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:16:46,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:46,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:46,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:16:46,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:46,889 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-06 00:16:46,889 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 00:16:46,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-06 00:16:46,894 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 00:16:46,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-06 00:16:46,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:16:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:16:46,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 00:16:46,907 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 00:16:46,909 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-06 00:16:46,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-06 00:16:46,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:16:46,914 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-06 00:16:46,916 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-06 00:16:46,920 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-06 00:16:46,920 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:46,921 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 00:16:46,924 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:46,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:46,925 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 00:16:46,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 00:16:46,940 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 00:16:46,941 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 00:16:46,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 29 events. 6/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 6 conditions per place. [2022-12-06 00:16:46,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 00:16:46,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 00:16:46,962 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:16:46,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 00:16:46,970 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-06 00:16:46,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:46,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:46,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:46,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:16:46,974 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:16:46,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:46,975 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-06 00:16:46,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:46,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688192150] [2022-12-06 00:16:46,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:46,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:16:47,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:47,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688192150] [2022-12-06 00:16:47,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688192150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:47,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:47,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:16:47,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296072024] [2022-12-06 00:16:47,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:47,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:16:47,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:47,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:16:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:16:47,135 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:16:47,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:47,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:47,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:16:47,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:47,232 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-06 00:16:47,233 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 00:16:47,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 38 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 182. Up to 153 conditions per place. [2022-12-06 00:16:47,235 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-06 00:16:47,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-06 00:16:47,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:16:47,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:16:47,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 00:16:47,237 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-06 00:16:47,237 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-06 00:16:47,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-06 00:16:47,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 00:16:47,238 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-06 00:16:47,239 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-06 00:16:47,239 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-06 00:16:47,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:47,240 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 00:16:47,240 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:47,241 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:47,241 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 00:16:47,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 00:16:47,245 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-06 00:16:47,245 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:16:47,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-06 00:16:47,246 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 00:16:47,246 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 00:16:47,556 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:16:47,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-06 00:16:47,558 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 80 flow [2022-12-06 00:16:47,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:47,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:47,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:47,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:16:47,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:16:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1878813032, now seen corresponding path program 1 times [2022-12-06 00:16:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:47,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405414282] [2022-12-06 00:16:47,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:16:47,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:47,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405414282] [2022-12-06 00:16:47,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405414282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:47,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:47,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:16:47,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473577840] [2022-12-06 00:16:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:47,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:16:47,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:47,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:16:47,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:16:47,705 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:16:47,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:47,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:47,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:16:47,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:47,834 INFO L130 PetriNetUnfolder]: 228/381 cut-off events. [2022-12-06 00:16:47,834 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 00:16:47,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 381 events. 228/381 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1410 event pairs, 40 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 858. Up to 212 conditions per place. [2022-12-06 00:16:47,837 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-06 00:16:47,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 266 flow [2022-12-06 00:16:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:16:47,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:16:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 00:16:47,839 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 00:16:47,839 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 80 flow. Second operand 5 states and 48 transitions. [2022-12-06 00:16:47,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 266 flow [2022-12-06 00:16:47,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 52 transitions, 244 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 00:16:47,841 INFO L231 Difference]: Finished difference. Result has 30 places, 39 transitions, 181 flow [2022-12-06 00:16:47,841 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=30, PETRI_TRANSITIONS=39} [2022-12-06 00:16:47,842 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-06 00:16:47,842 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:47,842 INFO L89 Accepts]: Start accepts. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 00:16:47,843 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:47,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:47,843 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 00:16:47,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 00:16:47,852 INFO L130 PetriNetUnfolder]: 29/82 cut-off events. [2022-12-06 00:16:47,852 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 00:16:47,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 82 events. 29/82 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 168. Up to 28 conditions per place. [2022-12-06 00:16:47,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 00:16:47,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 00:16:47,863 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:16:47,864 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 00:16:47,864 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 39 transitions, 181 flow [2022-12-06 00:16:47,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:47,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:47,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:47,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:16:47,865 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:16:47,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1128489956, now seen corresponding path program 2 times [2022-12-06 00:16:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949947668] [2022-12-06 00:16:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:16:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:47,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949947668] [2022-12-06 00:16:47,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949947668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:47,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:47,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:16:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801090117] [2022-12-06 00:16:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:47,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:16:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:16:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:16:47,959 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 00:16:47,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 39 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:47,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:47,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 00:16:47,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:48,046 INFO L130 PetriNetUnfolder]: 296/490 cut-off events. [2022-12-06 00:16:48,046 INFO L131 PetriNetUnfolder]: For 453/462 co-relation queries the response was YES. [2022-12-06 00:16:48,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 490 events. 296/490 cut-off events. For 453/462 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1909 event pairs, 100 based on Foata normal form. 5/449 useless extension candidates. Maximal degree in co-relation 874. Up to 263 conditions per place. [2022-12-06 00:16:48,050 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 46 selfloop transitions, 5 changer transitions 2/55 dead transitions. [2022-12-06 00:16:48,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 358 flow [2022-12-06 00:16:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:16:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:16:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 00:16:48,053 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 00:16:48,053 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 181 flow. Second operand 3 states and 39 transitions. [2022-12-06 00:16:48,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 358 flow [2022-12-06 00:16:48,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 354 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 00:16:48,059 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 207 flow [2022-12-06 00:16:48,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2022-12-06 00:16:48,060 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-06 00:16:48,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:48,060 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 00:16:48,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:48,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:48,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 00:16:48,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 00:16:48,071 INFO L130 PetriNetUnfolder]: 37/101 cut-off events. [2022-12-06 00:16:48,072 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 00:16:48,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 101 events. 37/101 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2022-12-06 00:16:48,073 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 00:16:48,073 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 00:16:48,080 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:16:48,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 00:16:48,081 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 207 flow [2022-12-06 00:16:48,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:48,082 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:48,082 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:48,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:16:48,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:16:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1026730500, now seen corresponding path program 1 times [2022-12-06 00:16:48,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:48,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797573924] [2022-12-06 00:16:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:48,266 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 00:16:48,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:48,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797573924] [2022-12-06 00:16:48,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797573924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:16:48,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931528856] [2022-12-06 00:16:48,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:48,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:16:48,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:16:48,271 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 00:16:48,298 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 00:16:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:48,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:16:48,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:16:48,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:16:48,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:16:48,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931528856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:48,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:16:48,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 00:16:48,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494794065] [2022-12-06 00:16:48,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:48,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:16:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:48,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:16:48,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:16:48,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:16:48,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:48,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:48,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:16:48,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:48,541 INFO L130 PetriNetUnfolder]: 304/527 cut-off events. [2022-12-06 00:16:48,541 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-06 00:16:48,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 527 events. 304/527 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2076 event pairs, 82 based on Foata normal form. 30/524 useless extension candidates. Maximal degree in co-relation 1085. Up to 374 conditions per place. [2022-12-06 00:16:48,555 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 5/57 dead transitions. [2022-12-06 00:16:48,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 389 flow [2022-12-06 00:16:48,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:16:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:16:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 00:16:48,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 00:16:48,557 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 207 flow. Second operand 3 states and 37 transitions. [2022-12-06 00:16:48,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 389 flow [2022-12-06 00:16:48,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:16:48,560 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 214 flow [2022-12-06 00:16:48,560 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=35, PETRI_TRANSITIONS=41} [2022-12-06 00:16:48,561 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-06 00:16:48,561 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:48,561 INFO L89 Accepts]: Start accepts. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 00:16:48,563 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:48,563 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:48,563 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 00:16:48,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 00:16:48,574 INFO L130 PetriNetUnfolder]: 37/114 cut-off events. [2022-12-06 00:16:48,574 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 00:16:48,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 114 events. 37/114 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 429 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 263. Up to 33 conditions per place. [2022-12-06 00:16:48,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 00:16:48,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 00:16:48,577 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:16:48,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 00:16:48,579 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 214 flow [2022-12-06 00:16:48,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:48,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:48,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:48,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 00:16:48,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:16:48,786 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:16:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271914, now seen corresponding path program 1 times [2022-12-06 00:16:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:48,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008093510] [2022-12-06 00:16:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:16:48,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:48,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008093510] [2022-12-06 00:16:48,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008093510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:16:48,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:16:48,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:16:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005789676] [2022-12-06 00:16:48,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:16:48,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:16:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:48,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:16:48,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:16:48,899 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 00:16:48,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:48,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:48,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 00:16:48,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:49,013 INFO L130 PetriNetUnfolder]: 344/631 cut-off events. [2022-12-06 00:16:49,013 INFO L131 PetriNetUnfolder]: For 799/816 co-relation queries the response was YES. [2022-12-06 00:16:49,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 631 events. 344/631 cut-off events. For 799/816 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2836 event pairs, 212 based on Foata normal form. 33/601 useless extension candidates. Maximal degree in co-relation 1467. Up to 476 conditions per place. [2022-12-06 00:16:49,017 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 38 selfloop transitions, 2 changer transitions 20/62 dead transitions. [2022-12-06 00:16:49,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 424 flow [2022-12-06 00:16:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:16:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:16:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 00:16:49,019 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 00:16:49,019 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 214 flow. Second operand 4 states and 43 transitions. [2022-12-06 00:16:49,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 424 flow [2022-12-06 00:16:49,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:16:49,025 INFO L231 Difference]: Finished difference. Result has 39 places, 42 transitions, 226 flow [2022-12-06 00:16:49,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=42} [2022-12-06 00:16:49,028 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-06 00:16:49,028 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:16:49,028 INFO L89 Accepts]: Start accepts. Operand has 39 places, 42 transitions, 226 flow [2022-12-06 00:16:49,029 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:16:49,029 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:16:49,029 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 42 transitions, 226 flow [2022-12-06 00:16:49,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 226 flow [2022-12-06 00:16:49,041 INFO L130 PetriNetUnfolder]: 37/115 cut-off events. [2022-12-06 00:16:49,041 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 00:16:49,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 115 events. 37/115 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 425 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 293. Up to 33 conditions per place. [2022-12-06 00:16:49,042 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 226 flow [2022-12-06 00:16:49,042 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 00:16:50,048 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:16:50,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1021 [2022-12-06 00:16:50,049 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 222 flow [2022-12-06 00:16:50,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:50,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:16:50,049 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:16:50,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:16:50,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:16:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:16:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash 788331176, now seen corresponding path program 1 times [2022-12-06 00:16:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:16:50,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363831217] [2022-12-06 00:16:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:16:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:51,470 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 00:16:51,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:16:51,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363831217] [2022-12-06 00:16:51,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363831217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:16:51,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682511665] [2022-12-06 00:16:51,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:16:51,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:16:51,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:16:51,472 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 00:16:51,497 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 00:16:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:16:51,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 00:16:51,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:16:51,637 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 00:16:51,679 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 7 treesize of output 3 [2022-12-06 00:16:51,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:16:51,780 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 00:16:52,035 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 00:16:52,036 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 38 treesize of output 10 [2022-12-06 00:16:52,068 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 00:16:52,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:16:52,517 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-06 00:16:52,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 256 [2022-12-06 00:16:52,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:16:52,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-06 00:16:52,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:16:52,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2022-12-06 00:16:53,162 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 00:16:53,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682511665] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:16:53,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:16:53,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 00:16:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601739087] [2022-12-06 00:16:53,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:16:53,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 00:16:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:16:53,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 00:16:53,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=545, Unknown=3, NotChecked=0, Total=702 [2022-12-06 00:16:53,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:16:53,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 222 flow. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:16:53,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:16:53,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:16:53,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:16:59,756 WARN L233 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 83 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:17:06,691 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:17:08,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:17:20,192 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 82 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:17:32,133 WARN L233 SmtUtils]: Spent 11.71s on a formula simplification. DAG size of input: 90 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:17:48,969 WARN L233 SmtUtils]: Spent 16.56s on a formula simplification. DAG size of input: 89 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:17:59,984 WARN L233 SmtUtils]: Spent 10.90s on a formula simplification. DAG size of input: 82 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:18:08,915 WARN L233 SmtUtils]: Spent 8.80s on a formula simplification. DAG size of input: 87 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:18:09,979 INFO L130 PetriNetUnfolder]: 1632/2867 cut-off events. [2022-12-06 00:18:09,979 INFO L131 PetriNetUnfolder]: For 2876/2876 co-relation queries the response was YES. [2022-12-06 00:18:09,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9658 conditions, 2867 events. 1632/2867 cut-off events. For 2876/2876 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16998 event pairs, 220 based on Foata normal form. 31/2709 useless extension candidates. Maximal degree in co-relation 9640. Up to 669 conditions per place. [2022-12-06 00:18:10,000 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 265 selfloop transitions, 121 changer transitions 84/470 dead transitions. [2022-12-06 00:18:10,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 470 transitions, 3198 flow [2022-12-06 00:18:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 00:18:10,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 00:18:10,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 363 transitions. [2022-12-06 00:18:10,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40468227424749165 [2022-12-06 00:18:10,006 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 222 flow. Second operand 39 states and 363 transitions. [2022-12-06 00:18:10,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 470 transitions, 3198 flow [2022-12-06 00:18:10,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 470 transitions, 3158 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 00:18:10,043 INFO L231 Difference]: Finished difference. Result has 96 places, 165 transitions, 1508 flow [2022-12-06 00:18:10,043 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1508, PETRI_PLACES=96, PETRI_TRANSITIONS=165} [2022-12-06 00:18:10,045 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 71 predicate places. [2022-12-06 00:18:10,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:10,045 INFO L89 Accepts]: Start accepts. Operand has 96 places, 165 transitions, 1508 flow [2022-12-06 00:18:10,049 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:10,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:10,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 165 transitions, 1508 flow [2022-12-06 00:18:10,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 165 transitions, 1508 flow [2022-12-06 00:18:10,141 INFO L130 PetriNetUnfolder]: 274/735 cut-off events. [2022-12-06 00:18:10,142 INFO L131 PetriNetUnfolder]: For 3652/3692 co-relation queries the response was YES. [2022-12-06 00:18:10,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 735 events. 274/735 cut-off events. For 3652/3692 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4837 event pairs, 6 based on Foata normal form. 5/716 useless extension candidates. Maximal degree in co-relation 3050. Up to 213 conditions per place. [2022-12-06 00:18:10,152 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 165 transitions, 1508 flow [2022-12-06 00:18:10,152 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 00:18:10,433 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:18:19,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:18:19,313 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:19,355 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 00:18:19,356 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9311 [2022-12-06 00:18:19,356 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 161 transitions, 1520 flow [2022-12-06 00:18:19,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:19,357 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:19,357 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:19,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 00:18:19,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 00:18:19,558 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:18:19,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash -613260868, now seen corresponding path program 1 times [2022-12-06 00:18:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:19,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574593856] [2022-12-06 00:18:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:19,683 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 00:18:19,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:19,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574593856] [2022-12-06 00:18:19,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574593856] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:18:19,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061736720] [2022-12-06 00:18:19,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:19,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:19,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:18:19,685 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 00:18:19,688 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 00:18:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:18:19,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:18:19,824 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 00:18:19,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:18:19,909 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 00:18:19,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061736720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:18:19,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:18:19,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-06 00:18:19,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739175714] [2022-12-06 00:18:19,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:18:19,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:18:19,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:19,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:18:19,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:18:19,911 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:18:19,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 161 transitions, 1520 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:19,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:19,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:18:19,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:20,486 INFO L130 PetriNetUnfolder]: 1316/2328 cut-off events. [2022-12-06 00:18:20,486 INFO L131 PetriNetUnfolder]: For 12652/12652 co-relation queries the response was YES. [2022-12-06 00:18:20,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11293 conditions, 2328 events. 1316/2328 cut-off events. For 12652/12652 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13087 event pairs, 206 based on Foata normal form. 66/2393 useless extension candidates. Maximal degree in co-relation 11193. Up to 710 conditions per place. [2022-12-06 00:18:20,512 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 131 selfloop transitions, 108 changer transitions 1/240 dead transitions. [2022-12-06 00:18:20,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 2674 flow [2022-12-06 00:18:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:18:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:18:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 00:18:20,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-06 00:18:20,514 INFO L175 Difference]: Start difference. First operand has 87 places, 161 transitions, 1520 flow. Second operand 6 states and 68 transitions. [2022-12-06 00:18:20,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 2674 flow [2022-12-06 00:18:20,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 240 transitions, 2396 flow, removed 114 selfloop flow, removed 7 redundant places. [2022-12-06 00:18:20,582 INFO L231 Difference]: Finished difference. Result has 89 places, 198 transitions, 2181 flow [2022-12-06 00:18:20,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2181, PETRI_PLACES=89, PETRI_TRANSITIONS=198} [2022-12-06 00:18:20,585 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 64 predicate places. [2022-12-06 00:18:20,585 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:20,585 INFO L89 Accepts]: Start accepts. Operand has 89 places, 198 transitions, 2181 flow [2022-12-06 00:18:20,588 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:20,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:20,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 198 transitions, 2181 flow [2022-12-06 00:18:20,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 198 transitions, 2181 flow [2022-12-06 00:18:20,690 INFO L130 PetriNetUnfolder]: 317/832 cut-off events. [2022-12-06 00:18:20,690 INFO L131 PetriNetUnfolder]: For 4478/4560 co-relation queries the response was YES. [2022-12-06 00:18:20,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 832 events. 317/832 cut-off events. For 4478/4560 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5479 event pairs, 4 based on Foata normal form. 6/816 useless extension candidates. Maximal degree in co-relation 3238. Up to 250 conditions per place. [2022-12-06 00:18:20,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 198 transitions, 2181 flow [2022-12-06 00:18:20,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-06 00:18:20,916 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:18:20,917 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 332 [2022-12-06 00:18:20,917 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 198 transitions, 2187 flow [2022-12-06 00:18:20,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:20,918 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:20,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:20,931 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 00:18:21,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:21,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:18:21,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash -713760388, now seen corresponding path program 2 times [2022-12-06 00:18:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:21,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345212489] [2022-12-06 00:18:21,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:21,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:21,962 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 00:18:21,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:21,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345212489] [2022-12-06 00:18:21,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345212489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:18:21,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989975895] [2022-12-06 00:18:21,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:18:21,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:21,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:18:21,964 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 00:18:21,986 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 00:18:22,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:18:22,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:18:22,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 00:18:22,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:18:24,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:18:24,243 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:18:24,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 00:18:24,254 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 27 treesize of output 15 [2022-12-06 00:18:24,337 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 00:18:24,358 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 00:18:24,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:18:24,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:24,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 00:18:24,751 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 42 treesize of output 36 [2022-12-06 00:18:24,909 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 00:18:24,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989975895] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:18:24,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:18:24,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 00:18:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549859586] [2022-12-06 00:18:24,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:18:24,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:18:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:18:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=283, Unknown=2, NotChecked=0, Total=380 [2022-12-06 00:18:24,912 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:18:24,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 198 transitions, 2187 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:24,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:24,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:18:24,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:27,398 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 [0] [2022-12-06 00:18:28,794 INFO L130 PetriNetUnfolder]: 1995/3478 cut-off events. [2022-12-06 00:18:28,795 INFO L131 PetriNetUnfolder]: For 20240/20240 co-relation queries the response was YES. [2022-12-06 00:18:28,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18444 conditions, 3478 events. 1995/3478 cut-off events. For 20240/20240 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20250 event pairs, 350 based on Foata normal form. 9/3486 useless extension candidates. Maximal degree in co-relation 16394. Up to 1298 conditions per place. [2022-12-06 00:18:28,832 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 229 selfloop transitions, 144 changer transitions 30/403 dead transitions. [2022-12-06 00:18:28,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 403 transitions, 4955 flow [2022-12-06 00:18:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:18:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:18:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-12-06 00:18:28,834 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29004329004329005 [2022-12-06 00:18:28,834 INFO L175 Difference]: Start difference. First operand has 88 places, 198 transitions, 2187 flow. Second operand 14 states and 134 transitions. [2022-12-06 00:18:28,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 403 transitions, 4955 flow [2022-12-06 00:18:28,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 403 transitions, 4813 flow, removed 48 selfloop flow, removed 1 redundant places. [2022-12-06 00:18:28,947 INFO L231 Difference]: Finished difference. Result has 109 places, 282 transitions, 3679 flow [2022-12-06 00:18:28,947 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3679, PETRI_PLACES=109, PETRI_TRANSITIONS=282} [2022-12-06 00:18:28,948 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 84 predicate places. [2022-12-06 00:18:28,948 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:28,948 INFO L89 Accepts]: Start accepts. Operand has 109 places, 282 transitions, 3679 flow [2022-12-06 00:18:28,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:28,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:28,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 282 transitions, 3679 flow [2022-12-06 00:18:28,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 282 transitions, 3679 flow [2022-12-06 00:18:29,111 INFO L130 PetriNetUnfolder]: 436/1132 cut-off events. [2022-12-06 00:18:29,111 INFO L131 PetriNetUnfolder]: For 8312/8385 co-relation queries the response was YES. [2022-12-06 00:18:29,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 1132 events. 436/1132 cut-off events. For 8312/8385 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7762 event pairs, 7 based on Foata normal form. 12/1131 useless extension candidates. Maximal degree in co-relation 6341. Up to 385 conditions per place. [2022-12-06 00:18:29,131 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 282 transitions, 3679 flow [2022-12-06 00:18:29,132 INFO L188 LiptonReduction]: Number of co-enabled transitions 1092 [2022-12-06 00:18:29,250 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:31,697 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:18:31,698 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2750 [2022-12-06 00:18:31,698 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 281 transitions, 3687 flow [2022-12-06 00:18:31,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:31,698 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:31,698 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:31,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:18:31,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:31,908 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:18:31,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash -677687481, now seen corresponding path program 1 times [2022-12-06 00:18:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:31,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20609715] [2022-12-06 00:18:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:32,102 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:18:32,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20609715] [2022-12-06 00:18:32,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20609715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:18:32,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687654016] [2022-12-06 00:18:32,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:32,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:32,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:18:32,104 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 00:18:32,107 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 00:18:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:32,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 00:18:32,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:18:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:18:32,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:18:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:18:32,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687654016] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:18:32,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:18:32,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-12-06 00:18:32,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886260278] [2022-12-06 00:18:32,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:18:32,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:18:32,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:32,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:18:32,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:18:32,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:18:32,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 281 transitions, 3687 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:32,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:32,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:18:32,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:33,462 INFO L130 PetriNetUnfolder]: 2132/3894 cut-off events. [2022-12-06 00:18:33,462 INFO L131 PetriNetUnfolder]: For 31195/31195 co-relation queries the response was YES. [2022-12-06 00:18:33,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23110 conditions, 3894 events. 2132/3894 cut-off events. For 31195/31195 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23655 event pairs, 329 based on Foata normal form. 208/4102 useless extension candidates. Maximal degree in co-relation 23014. Up to 1202 conditions per place. [2022-12-06 00:18:33,514 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 266 selfloop transitions, 134 changer transitions 24/424 dead transitions. [2022-12-06 00:18:33,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 424 transitions, 6111 flow [2022-12-06 00:18:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:18:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:18:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 00:18:33,518 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-06 00:18:33,518 INFO L175 Difference]: Start difference. First operand has 107 places, 281 transitions, 3687 flow. Second operand 8 states and 114 transitions. [2022-12-06 00:18:33,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 424 transitions, 6111 flow [2022-12-06 00:18:33,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 424 transitions, 5901 flow, removed 104 selfloop flow, removed 4 redundant places. [2022-12-06 00:18:33,709 INFO L231 Difference]: Finished difference. Result has 112 places, 280 transitions, 4080 flow [2022-12-06 00:18:33,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4080, PETRI_PLACES=112, PETRI_TRANSITIONS=280} [2022-12-06 00:18:33,710 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 87 predicate places. [2022-12-06 00:18:33,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:33,710 INFO L89 Accepts]: Start accepts. Operand has 112 places, 280 transitions, 4080 flow [2022-12-06 00:18:33,713 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:33,713 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:33,713 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 280 transitions, 4080 flow [2022-12-06 00:18:33,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 280 transitions, 4080 flow [2022-12-06 00:18:33,879 INFO L130 PetriNetUnfolder]: 487/1396 cut-off events. [2022-12-06 00:18:33,879 INFO L131 PetriNetUnfolder]: For 11077/11156 co-relation queries the response was YES. [2022-12-06 00:18:33,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8302 conditions, 1396 events. 487/1396 cut-off events. For 11077/11156 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10150 event pairs, 11 based on Foata normal form. 14/1392 useless extension candidates. Maximal degree in co-relation 7698. Up to 448 conditions per place. [2022-12-06 00:18:33,900 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 280 transitions, 4080 flow [2022-12-06 00:18:33,900 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-06 00:18:33,906 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L79: Formula: (and (= (ite (= (ite (and (<= v_~new~0_66 v_~v_old~0_93) (not (= (mod v_~ok~0_101 256) 0))) 1 0) 0) 0 1) v_~ok~0_100) (= v_~new~0_66 (select (select |v_#memory_int_298| v_~queue~0.base_124) (+ v_~queue~0.offset_125 (* v_~start~0_158 4)))) (= (ite (= (ite (or (< v_~i~0_198 v_~N~0_169) (< v_~start~0_157 v_~end~0_214)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (ite (and (< v_~start~0_158 v_~end~0_214) (< v_~start~0_158 v_~n~0_123) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~new~0_66 v_~v_old~0_92)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_101, ~i~0=v_~i~0_198, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~N~0=v_~N~0_169, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_124, ~n~0=v_~n~0_123} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_198, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_169, ~queue~0.base=v_~queue~0.base_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_76|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_123} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:33,997 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L79: Formula: (and (= (ite (= (ite (and (<= v_~new~0_66 v_~v_old~0_93) (not (= (mod v_~ok~0_101 256) 0))) 1 0) 0) 0 1) v_~ok~0_100) (= v_~new~0_66 (select (select |v_#memory_int_298| v_~queue~0.base_124) (+ v_~queue~0.offset_125 (* v_~start~0_158 4)))) (= (ite (= (ite (or (< v_~i~0_198 v_~N~0_169) (< v_~start~0_157 v_~end~0_214)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (ite (and (< v_~start~0_158 v_~end~0_214) (< v_~start~0_158 v_~n~0_123) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~new~0_66 v_~v_old~0_92)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_101, ~i~0=v_~i~0_198, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~N~0=v_~N~0_169, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_124, ~n~0=v_~n~0_123} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_198, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_169, ~queue~0.base=v_~queue~0.base_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_76|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_123} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:34,087 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:34,173 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:34,264 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:34,371 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:18:34,441 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_20)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 00:18:34,537 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:18:34,539 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 829 [2022-12-06 00:18:34,539 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 279 transitions, 4124 flow [2022-12-06 00:18:34,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:34,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:34,539 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:34,549 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 00:18:34,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 00:18:34,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:18:34,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:34,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1504779699, now seen corresponding path program 1 times [2022-12-06 00:18:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:34,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853229072] [2022-12-06 00:18:34,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:36,398 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 00:18:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:36,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853229072] [2022-12-06 00:18:36,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853229072] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:18:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832217525] [2022-12-06 00:18:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:36,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:36,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:18:36,404 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 00:18:36,407 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 00:18:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:36,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 00:18:36,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:18:36,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:18:36,747 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:18:36,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 00:18:36,760 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 27 treesize of output 15 [2022-12-06 00:18:36,902 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 00:18:36,931 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 00:18:36,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:18:37,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:37,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 00:18:37,345 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 42 treesize of output 36 [2022-12-06 00:18:37,684 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 00:18:37,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832217525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:18:37,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:18:37,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 00:18:37,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108637001] [2022-12-06 00:18:37,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:18:37,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 00:18:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:37,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 00:18:37,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-12-06 00:18:37,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 00:18:37,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 279 transitions, 4124 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:37,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:37,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 00:18:37,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:18:47,705 INFO L130 PetriNetUnfolder]: 4771/8618 cut-off events. [2022-12-06 00:18:47,705 INFO L131 PetriNetUnfolder]: For 67927/67927 co-relation queries the response was YES. [2022-12-06 00:18:47,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54503 conditions, 8618 events. 4771/8618 cut-off events. For 67927/67927 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 59333 event pairs, 399 based on Foata normal form. 39/8615 useless extension candidates. Maximal degree in co-relation 48553. Up to 2705 conditions per place. [2022-12-06 00:18:47,778 INFO L137 encePairwiseOnDemand]: 9/42 looper letters, 592 selfloop transitions, 499 changer transitions 133/1224 dead transitions. [2022-12-06 00:18:47,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1224 transitions, 17861 flow [2022-12-06 00:18:47,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-06 00:18:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2022-12-06 00:18:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 568 transitions. [2022-12-06 00:18:47,782 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2146636432350718 [2022-12-06 00:18:47,782 INFO L175 Difference]: Start difference. First operand has 111 places, 279 transitions, 4124 flow. Second operand 63 states and 568 transitions. [2022-12-06 00:18:47,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 1224 transitions, 17861 flow [2022-12-06 00:18:48,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 1224 transitions, 17717 flow, removed 72 selfloop flow, removed 0 redundant places. [2022-12-06 00:18:48,168 INFO L231 Difference]: Finished difference. Result has 215 places, 647 transitions, 11294 flow [2022-12-06 00:18:48,168 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4086, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=11294, PETRI_PLACES=215, PETRI_TRANSITIONS=647} [2022-12-06 00:18:48,169 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 190 predicate places. [2022-12-06 00:18:48,169 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:18:48,169 INFO L89 Accepts]: Start accepts. Operand has 215 places, 647 transitions, 11294 flow [2022-12-06 00:18:48,172 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:18:48,172 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:18:48,172 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 647 transitions, 11294 flow [2022-12-06 00:18:48,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 647 transitions, 11294 flow [2022-12-06 00:18:48,667 INFO L130 PetriNetUnfolder]: 1049/2819 cut-off events. [2022-12-06 00:18:48,667 INFO L131 PetriNetUnfolder]: For 51300/51449 co-relation queries the response was YES. [2022-12-06 00:18:48,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22057 conditions, 2819 events. 1049/2819 cut-off events. For 51300/51449 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 22938 event pairs, 10 based on Foata normal form. 23/2818 useless extension candidates. Maximal degree in co-relation 21713. Up to 1033 conditions per place. [2022-12-06 00:18:48,715 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 647 transitions, 11294 flow [2022-12-06 00:18:48,716 INFO L188 LiptonReduction]: Number of co-enabled transitions 2226 [2022-12-06 00:18:48,722 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 00:18:48,820 WARN L322 ript$VariableManager]: TermVariable LBE74 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:18:48,820 WARN L322 ript$VariableManager]: TermVariable LBE304 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:18:49,051 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 00:18:49,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:49,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:18:49,382 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:49,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:49,661 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:49,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:18:49,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:50,073 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 00:18:50,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:50,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:52,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [716] L79-->L55-1: Formula: (and (= (ite (and (<= 0 v_~start~0_203) (< v_~start~0_203 v_~end~0_250) (< v_~start~0_203 v_~n~0_145)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (= (+ v_~start~0_203 1) v_~start~0_202) (= (ite (= (ite (and (not (= (mod v_~ok~0_141 256) 0)) (<= v_~new~0_88 v_~v_old~0_132)) 1 0) 0) 0 1) v_~ok~0_140) (= v_~last~0_111 |v_thread1Thread1of1ForFork0_#t~mem5#1_71|) (= v_~new~0_88 v_~v_old~0_131) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_124| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45| 0)) (= (select (select |v_#memory_int_340| v_~A~0.base_158) (+ v_~A~0.offset_158 (* v_~i~0_247 4))) |v_thread1Thread1of1ForFork0_#t~mem5#1_71|) (= |v_thread2Thread1of1ForFork1_~cond~0#1_123| (ite (= (ite (or (< v_~i~0_247 v_~N~0_197) (< v_~start~0_202 v_~end~0_250)) 1 0) 0) 0 1)) (= v_~new~0_88 (select (select |v_#memory_int_340| v_~queue~0.base_148) (+ (* v_~start~0_203 4) v_~queue~0.offset_149)))) InVars {~start~0=v_~start~0_203, ~A~0.base=v_~A~0.base_158, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_141, ~i~0=v_~i~0_247, ~N~0=v_~N~0_197, ~queue~0.base=v_~queue~0.base_148, ~A~0.offset=v_~A~0.offset_158, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_124|, #memory_int=|v_#memory_int_340|, ~end~0=v_~end~0_250, ~v_old~0=v_~v_old~0_132, ~n~0=v_~n~0_145} OutVars{~start~0=v_~start~0_202, ~new~0=v_~new~0_88, ~A~0.base=v_~A~0.base_158, ~queue~0.offset=v_~queue~0.offset_149, ~ok~0=v_~ok~0_140, ~i~0=v_~i~0_247, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_45|, ~N~0=v_~N~0_197, ~queue~0.base=v_~queue~0.base_148, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_45|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_71|, ~A~0.offset=v_~A~0.offset_158, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_45|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_123|, #memory_int=|v_#memory_int_340|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_45|, ~end~0=v_~end~0_250, ~v_old~0=v_~v_old~0_131, ~n~0=v_~n~0_145, ~last~0=v_~last~0_111} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:52,230 WARN L322 ript$VariableManager]: TermVariable LBE74 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:18:52,230 WARN L322 ript$VariableManager]: TermVariable LBE304 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:18:52,669 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:52,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:18:52,830 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:52,953 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:53,054 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:18:53,179 INFO L203 LiptonReduction]: Total number of compositions: 11 [2022-12-06 00:18:53,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5011 [2022-12-06 00:18:53,180 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 638 transitions, 11382 flow [2022-12-06 00:18:53,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:53,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:18:53,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:18:53,187 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 00:18:53,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:53,382 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:18:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:18:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash 715040934, now seen corresponding path program 1 times [2022-12-06 00:18:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:18:53,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857885259] [2022-12-06 00:18:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:18:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:55,182 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 00:18:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:18:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857885259] [2022-12-06 00:18:55,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857885259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:18:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958876259] [2022-12-06 00:18:55,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:18:55,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:18:55,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:18:55,184 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 00:18:55,186 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 00:18:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:18:55,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 00:18:55,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:18:55,657 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-06 00:18:55,658 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 42 treesize of output 10 [2022-12-06 00:18:55,689 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 00:18:55,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:18:58,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:18:58,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 126 [2022-12-06 00:18:58,308 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 00:18:58,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958876259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:18:58,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:18:58,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-06 00:18:58,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877035766] [2022-12-06 00:18:58,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:18:58,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:18:58,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:18:58,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:18:58,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2022-12-06 00:18:58,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 73 [2022-12-06 00:18:58,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 638 transitions, 11382 flow. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:18:58,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:18:58,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 73 [2022-12-06 00:18:58,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:03,179 INFO L130 PetriNetUnfolder]: 6522/11477 cut-off events. [2022-12-06 00:19:03,179 INFO L131 PetriNetUnfolder]: For 199739/199739 co-relation queries the response was YES. [2022-12-06 00:19:03,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92694 conditions, 11477 events. 6522/11477 cut-off events. For 199739/199739 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 81810 event pairs, 563 based on Foata normal form. 13/11470 useless extension candidates. Maximal degree in co-relation 92329. Up to 4193 conditions per place. [2022-12-06 00:19:03,334 INFO L137 encePairwiseOnDemand]: 23/73 looper letters, 555 selfloop transitions, 509 changer transitions 35/1099 dead transitions. [2022-12-06 00:19:03,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1099 transitions, 20880 flow [2022-12-06 00:19:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:19:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:19:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 227 transitions. [2022-12-06 00:19:03,336 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18291700241740533 [2022-12-06 00:19:03,336 INFO L175 Difference]: Start difference. First operand has 200 places, 638 transitions, 11382 flow. Second operand 17 states and 227 transitions. [2022-12-06 00:19:03,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1099 transitions, 20880 flow [2022-12-06 00:19:05,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1099 transitions, 19577 flow, removed 647 selfloop flow, removed 14 redundant places. [2022-12-06 00:19:05,345 INFO L231 Difference]: Finished difference. Result has 214 places, 868 transitions, 16466 flow [2022-12-06 00:19:05,346 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=10533, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=16466, PETRI_PLACES=214, PETRI_TRANSITIONS=868} [2022-12-06 00:19:05,346 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 189 predicate places. [2022-12-06 00:19:05,346 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:05,346 INFO L89 Accepts]: Start accepts. Operand has 214 places, 868 transitions, 16466 flow [2022-12-06 00:19:05,350 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:05,350 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:05,351 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 868 transitions, 16466 flow [2022-12-06 00:19:05,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 868 transitions, 16466 flow [2022-12-06 00:19:06,219 INFO L130 PetriNetUnfolder]: 1568/4049 cut-off events. [2022-12-06 00:19:06,219 INFO L131 PetriNetUnfolder]: For 74864/75049 co-relation queries the response was YES. [2022-12-06 00:19:06,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32559 conditions, 4049 events. 1568/4049 cut-off events. For 74864/75049 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 35187 event pairs, 13 based on Foata normal form. 28/4051 useless extension candidates. Maximal degree in co-relation 32396. Up to 1514 conditions per place. [2022-12-06 00:19:06,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 868 transitions, 16466 flow [2022-12-06 00:19:06,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 3136 [2022-12-06 00:19:11,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:19:11,573 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:19:11,711 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:19:11,712 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6366 [2022-12-06 00:19:11,712 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 867 transitions, 16553 flow [2022-12-06 00:19:11,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:11,712 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:11,712 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:11,719 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 00:19:11,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:11,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:11,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:11,914 INFO L85 PathProgramCache]: Analyzing trace with hash 568509370, now seen corresponding path program 1 times [2022-12-06 00:19:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:11,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125123564] [2022-12-06 00:19:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:13,667 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 00:19:13,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:13,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125123564] [2022-12-06 00:19:13,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125123564] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:13,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706420322] [2022-12-06 00:19:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:13,669 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:13,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 00:19:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:13,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 00:19:13,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:13,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:13,950 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:19:13,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 00:19:13,960 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 27 treesize of output 15 [2022-12-06 00:19:14,152 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 00:19:14,174 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 00:19:14,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:14,587 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-06 00:19:14,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 73 [2022-12-06 00:19:14,596 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 33 treesize of output 27 [2022-12-06 00:19:14,749 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 00:19:14,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706420322] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:14,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:14,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 00:19:14,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290261646] [2022-12-06 00:19:14,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:14,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 00:19:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 00:19:14,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=415, Unknown=1, NotChecked=0, Total=552 [2022-12-06 00:19:14,751 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 79 [2022-12-06 00:19:14,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 867 transitions, 16553 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:14,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:14,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 79 [2022-12-06 00:19:14,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:21,068 INFO L130 PetriNetUnfolder]: 8561/14929 cut-off events. [2022-12-06 00:19:21,068 INFO L131 PetriNetUnfolder]: For 274848/274848 co-relation queries the response was YES. [2022-12-06 00:19:21,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124761 conditions, 14929 events. 8561/14929 cut-off events. For 274848/274848 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 110322 event pairs, 1030 based on Foata normal form. 13/14920 useless extension candidates. Maximal degree in co-relation 124577. Up to 5594 conditions per place. [2022-12-06 00:19:21,269 INFO L137 encePairwiseOnDemand]: 26/79 looper letters, 470 selfloop transitions, 790 changer transitions 34/1294 dead transitions. [2022-12-06 00:19:21,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1294 transitions, 26443 flow [2022-12-06 00:19:21,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:19:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:19:21,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 234 transitions. [2022-12-06 00:19:21,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1742367833209233 [2022-12-06 00:19:21,271 INFO L175 Difference]: Start difference. First operand has 212 places, 867 transitions, 16553 flow. Second operand 17 states and 234 transitions. [2022-12-06 00:19:21,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1294 transitions, 26443 flow [2022-12-06 00:19:24,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 1294 transitions, 25973 flow, removed 167 selfloop flow, removed 6 redundant places. [2022-12-06 00:19:24,067 INFO L231 Difference]: Finished difference. Result has 234 places, 1083 transitions, 23510 flow [2022-12-06 00:19:24,068 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=16223, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=867, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=574, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=23510, PETRI_PLACES=234, PETRI_TRANSITIONS=1083} [2022-12-06 00:19:24,069 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 209 predicate places. [2022-12-06 00:19:24,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:24,069 INFO L89 Accepts]: Start accepts. Operand has 234 places, 1083 transitions, 23510 flow [2022-12-06 00:19:24,076 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:24,076 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:24,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 234 places, 1083 transitions, 23510 flow [2022-12-06 00:19:24,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 1083 transitions, 23510 flow [2022-12-06 00:19:25,219 INFO L130 PetriNetUnfolder]: 2087/5276 cut-off events. [2022-12-06 00:19:25,219 INFO L131 PetriNetUnfolder]: For 118125/118329 co-relation queries the response was YES. [2022-12-06 00:19:25,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46276 conditions, 5276 events. 2087/5276 cut-off events. For 118125/118329 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 47693 event pairs, 13 based on Foata normal form. 22/5268 useless extension candidates. Maximal degree in co-relation 46181. Up to 1983 conditions per place. [2022-12-06 00:19:25,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 1083 transitions, 23510 flow [2022-12-06 00:19:25,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 4050 [2022-12-06 00:19:26,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:19:26,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2330 [2022-12-06 00:19:26,399 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 1083 transitions, 23536 flow [2022-12-06 00:19:26,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:26,400 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:26,400 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:26,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 00:19:26,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 00:19:26,605 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:26,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1647372156, now seen corresponding path program 1 times [2022-12-06 00:19:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:26,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754997986] [2022-12-06 00:19:26,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:26,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:27,510 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 00:19:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:27,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754997986] [2022-12-06 00:19:27,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754997986] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:27,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110582085] [2022-12-06 00:19:27,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:27,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:27,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:27,512 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:27,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:19:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:27,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 00:19:27,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:27,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:27,717 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 00:19:27,872 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 00:19:27,894 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 00:19:27,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:30,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:30,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 278 [2022-12-06 00:19:30,405 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:30,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-06 00:19:30,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:30,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2022-12-06 00:19:31,767 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 00:19:31,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110582085] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:19:31,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:19:31,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 19 [2022-12-06 00:19:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138619937] [2022-12-06 00:19:31,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:19:31,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:19:31,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:19:31,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:19:31,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=320, Unknown=3, NotChecked=0, Total=420 [2022-12-06 00:19:31,769 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 80 [2022-12-06 00:19:31,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1083 transitions, 23536 flow. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:31,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:19:31,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 80 [2022-12-06 00:19:31,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:19:38,500 INFO L130 PetriNetUnfolder]: 10150/17738 cut-off events. [2022-12-06 00:19:38,501 INFO L131 PetriNetUnfolder]: For 385275/385275 co-relation queries the response was YES. [2022-12-06 00:19:38,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158944 conditions, 17738 events. 10150/17738 cut-off events. For 385275/385275 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 134332 event pairs, 1333 based on Foata normal form. 18/17734 useless extension candidates. Maximal degree in co-relation 158807. Up to 7991 conditions per place. [2022-12-06 00:19:38,752 INFO L137 encePairwiseOnDemand]: 34/80 looper letters, 778 selfloop transitions, 610 changer transitions 37/1425 dead transitions. [2022-12-06 00:19:38,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1425 transitions, 32627 flow [2022-12-06 00:19:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:19:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:19:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 204 transitions. [2022-12-06 00:19:38,764 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19615384615384615 [2022-12-06 00:19:38,764 INFO L175 Difference]: Start difference. First operand has 233 places, 1083 transitions, 23536 flow. Second operand 13 states and 204 transitions. [2022-12-06 00:19:38,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1425 transitions, 32627 flow [2022-12-06 00:19:42,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 1425 transitions, 32299 flow, removed 147 selfloop flow, removed 4 redundant places. [2022-12-06 00:19:42,892 INFO L231 Difference]: Finished difference. Result has 246 places, 1227 transitions, 28707 flow [2022-12-06 00:19:42,894 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=23085, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=28707, PETRI_PLACES=246, PETRI_TRANSITIONS=1227} [2022-12-06 00:19:42,894 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 221 predicate places. [2022-12-06 00:19:42,894 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:19:42,894 INFO L89 Accepts]: Start accepts. Operand has 246 places, 1227 transitions, 28707 flow [2022-12-06 00:19:42,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:19:42,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:19:42,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 246 places, 1227 transitions, 28707 flow [2022-12-06 00:19:42,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 1227 transitions, 28707 flow [2022-12-06 00:19:44,281 INFO L130 PetriNetUnfolder]: 2477/6307 cut-off events. [2022-12-06 00:19:44,281 INFO L131 PetriNetUnfolder]: For 148492/148713 co-relation queries the response was YES. [2022-12-06 00:19:44,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57069 conditions, 6307 events. 2477/6307 cut-off events. For 148492/148713 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 59347 event pairs, 21 based on Foata normal form. 24/6298 useless extension candidates. Maximal degree in co-relation 56891. Up to 2368 conditions per place. [2022-12-06 00:19:44,420 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 1227 transitions, 28707 flow [2022-12-06 00:19:44,421 INFO L188 LiptonReduction]: Number of co-enabled transitions 4664 [2022-12-06 00:19:47,849 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:19:47,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4956 [2022-12-06 00:19:47,850 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 1227 transitions, 28724 flow [2022-12-06 00:19:47,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:19:47,850 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:19:47,850 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:19:47,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 00:19:48,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 00:19:48,057 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:19:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:19:48,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1633352920, now seen corresponding path program 2 times [2022-12-06 00:19:48,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:19:48,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840540812] [2022-12-06 00:19:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:19:48,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:19:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:19:49,378 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 00:19:49,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:19:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840540812] [2022-12-06 00:19:49,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840540812] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:19:49,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317391912] [2022-12-06 00:19:49,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:19:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:19:49,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:19:49,381 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:19:49,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:19:49,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:19:49,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:19:49,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-06 00:19:49,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:19:49,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 00:19:49,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:49,608 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 14 treesize of output 16 [2022-12-06 00:19:49,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:49,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:19:49,818 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 00:19:49,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-12-06 00:19:49,965 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 00:19:49,965 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 34 treesize of output 10 [2022-12-06 00:19:49,991 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 00:19:49,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:19:50,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:50,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 85 [2022-12-06 00:19:50,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:50,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 367 treesize of output 433 [2022-12-06 00:19:50,401 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:19:50,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 313 [2022-12-06 00:19:50,416 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 234 treesize of output 210 [2022-12-06 00:20:00,675 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 00:20:00,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317391912] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:00,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:00,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-06 00:20:00,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087786024] [2022-12-06 00:20:00,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:00,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 00:20:00,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:00,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 00:20:00,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-12-06 00:20:00,677 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 00:20:00,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 1227 transitions, 28724 flow. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:00,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:00,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 00:20:00,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:09,328 INFO L130 PetriNetUnfolder]: 11711/20402 cut-off events. [2022-12-06 00:20:09,329 INFO L131 PetriNetUnfolder]: For 463259/463259 co-relation queries the response was YES. [2022-12-06 00:20:09,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188345 conditions, 20402 events. 11711/20402 cut-off events. For 463259/463259 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 158235 event pairs, 1216 based on Foata normal form. 25/20405 useless extension candidates. Maximal degree in co-relation 188146. Up to 8864 conditions per place. [2022-12-06 00:20:09,620 INFO L137 encePairwiseOnDemand]: 33/78 looper letters, 805 selfloop transitions, 775 changer transitions 28/1608 dead transitions. [2022-12-06 00:20:09,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1608 transitions, 39531 flow [2022-12-06 00:20:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:20:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:20:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 193 transitions. [2022-12-06 00:20:09,622 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1903353057199211 [2022-12-06 00:20:09,622 INFO L175 Difference]: Start difference. First operand has 244 places, 1227 transitions, 28724 flow. Second operand 13 states and 193 transitions. [2022-12-06 00:20:09,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1608 transitions, 39531 flow [2022-12-06 00:20:14,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 1608 transitions, 39339 flow, removed 79 selfloop flow, removed 4 redundant places. [2022-12-06 00:20:14,581 INFO L231 Difference]: Finished difference. Result has 260 places, 1411 transitions, 35983 flow [2022-12-06 00:20:14,582 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=28430, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=586, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35983, PETRI_PLACES=260, PETRI_TRANSITIONS=1411} [2022-12-06 00:20:14,583 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 235 predicate places. [2022-12-06 00:20:14,583 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:14,583 INFO L89 Accepts]: Start accepts. Operand has 260 places, 1411 transitions, 35983 flow [2022-12-06 00:20:14,591 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:14,591 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:14,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 1411 transitions, 35983 flow [2022-12-06 00:20:14,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 1411 transitions, 35983 flow [2022-12-06 00:20:16,496 INFO L130 PetriNetUnfolder]: 2860/7250 cut-off events. [2022-12-06 00:20:16,496 INFO L131 PetriNetUnfolder]: For 186004/186234 co-relation queries the response was YES. [2022-12-06 00:20:16,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68615 conditions, 7250 events. 2860/7250 cut-off events. For 186004/186234 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 69881 event pairs, 14 based on Foata normal form. 24/7238 useless extension candidates. Maximal degree in co-relation 68450. Up to 2782 conditions per place. [2022-12-06 00:20:16,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 1411 transitions, 35983 flow [2022-12-06 00:20:16,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 5446 [2022-12-06 00:20:16,671 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:20:16,672 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2089 [2022-12-06 00:20:16,672 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 1411 transitions, 35983 flow [2022-12-06 00:20:16,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:16,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:16,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:16,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 00:20:16,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 00:20:16,875 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:16,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash 553895052, now seen corresponding path program 1 times [2022-12-06 00:20:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:16,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927136616] [2022-12-06 00:20:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:16,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:16,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:16,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927136616] [2022-12-06 00:20:16,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927136616] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:16,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491641717] [2022-12-06 00:20:16,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:16,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:16,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:16,960 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:20:16,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:20:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:17,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:20:17,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:17,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:20:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:17,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491641717] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:20:17,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:20:17,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-12-06 00:20:17,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819765343] [2022-12-06 00:20:17,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:20:17,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:20:17,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:17,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:20:17,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:20:17,181 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 00:20:17,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1411 transitions, 35983 flow. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:17,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:17,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 00:20:17,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:26,614 INFO L130 PetriNetUnfolder]: 12545/21822 cut-off events. [2022-12-06 00:20:26,615 INFO L131 PetriNetUnfolder]: For 555663/555663 co-relation queries the response was YES. [2022-12-06 00:20:26,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211476 conditions, 21822 events. 12545/21822 cut-off events. For 555663/555663 co-relation queries the response was YES. Maximal size of possible extension queue 786. Compared 171421 event pairs, 1160 based on Foata normal form. 137/21943 useless extension candidates. Maximal degree in co-relation 211290. Up to 10427 conditions per place. [2022-12-06 00:20:27,033 INFO L137 encePairwiseOnDemand]: 39/78 looper letters, 1510 selfloop transitions, 228 changer transitions 1/1739 dead transitions. [2022-12-06 00:20:27,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1739 transitions, 47073 flow [2022-12-06 00:20:27,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:20:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:20:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-12-06 00:20:27,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-06 00:20:27,034 INFO L175 Difference]: Start difference. First operand has 259 places, 1411 transitions, 35983 flow. Second operand 7 states and 143 transitions. [2022-12-06 00:20:27,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1739 transitions, 47073 flow [2022-12-06 00:20:33,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 1739 transitions, 46284 flow, removed 45 selfloop flow, removed 7 redundant places. [2022-12-06 00:20:33,922 INFO L231 Difference]: Finished difference. Result has 260 places, 1480 transitions, 37360 flow [2022-12-06 00:20:33,923 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=35300, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=37360, PETRI_PLACES=260, PETRI_TRANSITIONS=1480} [2022-12-06 00:20:33,924 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 235 predicate places. [2022-12-06 00:20:33,924 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:20:33,924 INFO L89 Accepts]: Start accepts. Operand has 260 places, 1480 transitions, 37360 flow [2022-12-06 00:20:33,934 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:20:33,934 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:20:33,934 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 1480 transitions, 37360 flow [2022-12-06 00:20:33,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 1480 transitions, 37360 flow [2022-12-06 00:20:36,240 INFO L130 PetriNetUnfolder]: 3102/7828 cut-off events. [2022-12-06 00:20:36,241 INFO L131 PetriNetUnfolder]: For 217610/217917 co-relation queries the response was YES. [2022-12-06 00:20:36,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78022 conditions, 7828 events. 3102/7828 cut-off events. For 217610/217917 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 76399 event pairs, 24 based on Foata normal form. 32/7824 useless extension candidates. Maximal degree in co-relation 76951. Up to 3025 conditions per place. [2022-12-06 00:20:36,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 1480 transitions, 37360 flow [2022-12-06 00:20:36,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 5630 [2022-12-06 00:20:44,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [733] L54-->L59: Formula: (and (= (+ v_~i~0_292 1) v_~i~0_291) (= v_~last~0_137 (select (select |v_#memory_int_374| v_~A~0.base_184) (+ (* v_~i~0_292 4) v_~A~0.offset_184)))) InVars {~A~0.base=v_~A~0.base_184, ~A~0.offset=v_~A~0.offset_184, ~i~0=v_~i~0_292, #memory_int=|v_#memory_int_374|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_109|, ~A~0.base=v_~A~0.base_184, ~A~0.offset=v_~A~0.offset_184, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_64|, ~i~0=v_~i~0_291, #memory_int=|v_#memory_int_374|, ~last~0=v_~last~0_137} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 00:20:44,677 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:20:44,677 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10753 [2022-12-06 00:20:44,678 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 1480 transitions, 37392 flow [2022-12-06 00:20:44,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:44,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:20:44,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:20:44,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:20:44,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 00:20:44,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:20:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:20:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1593503632, now seen corresponding path program 1 times [2022-12-06 00:20:44,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:20:44,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649073397] [2022-12-06 00:20:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:20:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:20:44,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649073397] [2022-12-06 00:20:44,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649073397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:20:44,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132074697] [2022-12-06 00:20:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:20:44,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:20:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:20:44,976 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:20:44,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:20:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:20:45,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:20:45,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:20:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:20:45,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:20:45,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132074697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:20:45,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:20:45,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 00:20:45,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940973908] [2022-12-06 00:20:45,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:20:45,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:20:45,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:20:45,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:20:45,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:20:45,155 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 81 [2022-12-06 00:20:45,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 1480 transitions, 37392 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:20:45,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:20:45,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 81 [2022-12-06 00:20:45,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:20:54,797 INFO L130 PetriNetUnfolder]: 12508/22118 cut-off events. [2022-12-06 00:20:54,797 INFO L131 PetriNetUnfolder]: For 592573/592573 co-relation queries the response was YES. [2022-12-06 00:20:55,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217377 conditions, 22118 events. 12508/22118 cut-off events. For 592573/592573 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 176118 event pairs, 4815 based on Foata normal form. 358/22460 useless extension candidates. Maximal degree in co-relation 215405. Up to 20822 conditions per place. [2022-12-06 00:20:55,153 INFO L137 encePairwiseOnDemand]: 62/81 looper letters, 1400 selfloop transitions, 4 changer transitions 169/1573 dead transitions. [2022-12-06 00:20:55,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1573 transitions, 42525 flow [2022-12-06 00:20:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:20:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:20:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-06 00:20:55,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28641975308641976 [2022-12-06 00:20:55,154 INFO L175 Difference]: Start difference. First operand has 260 places, 1480 transitions, 37392 flow. Second operand 5 states and 116 transitions. [2022-12-06 00:20:55,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1573 transitions, 42525 flow [2022-12-06 00:21:01,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 1573 transitions, 42302 flow, removed 104 selfloop flow, removed 2 redundant places. [2022-12-06 00:21:01,906 INFO L231 Difference]: Finished difference. Result has 265 places, 1404 transitions, 34958 flow [2022-12-06 00:21:01,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=36062, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=34958, PETRI_PLACES=265, PETRI_TRANSITIONS=1404} [2022-12-06 00:21:01,908 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 240 predicate places. [2022-12-06 00:21:01,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:01,908 INFO L89 Accepts]: Start accepts. Operand has 265 places, 1404 transitions, 34958 flow [2022-12-06 00:21:01,917 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:01,917 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:01,917 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 1404 transitions, 34958 flow [2022-12-06 00:21:01,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 262 places, 1404 transitions, 34958 flow [2022-12-06 00:21:03,926 INFO L130 PetriNetUnfolder]: 2966/7449 cut-off events. [2022-12-06 00:21:03,926 INFO L131 PetriNetUnfolder]: For 198495/198718 co-relation queries the response was YES. [2022-12-06 00:21:03,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73370 conditions, 7449 events. 2966/7449 cut-off events. For 198495/198718 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 71924 event pairs, 22 based on Foata normal form. 31/7436 useless extension candidates. Maximal degree in co-relation 72951. Up to 2892 conditions per place. [2022-12-06 00:21:04,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 262 places, 1404 transitions, 34958 flow [2022-12-06 00:21:04,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 5394 [2022-12-06 00:21:04,069 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:04,069 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2161 [2022-12-06 00:21:04,069 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 1404 transitions, 34958 flow [2022-12-06 00:21:04,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:04,069 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:04,069 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:04,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 00:21:04,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 00:21:04,270 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:21:04,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1905270724, now seen corresponding path program 1 times [2022-12-06 00:21:04,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:04,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908626111] [2022-12-06 00:21:04,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:04,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:04,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908626111] [2022-12-06 00:21:04,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908626111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:04,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:04,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881470369] [2022-12-06 00:21:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:04,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:21:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:04,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:21:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:21:04,536 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 77 [2022-12-06 00:21:04,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 1404 transitions, 34958 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:04,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:04,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 77 [2022-12-06 00:21:04,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:13,795 INFO L130 PetriNetUnfolder]: 12170/21265 cut-off events. [2022-12-06 00:21:13,795 INFO L131 PetriNetUnfolder]: For 546665/546665 co-relation queries the response was YES. [2022-12-06 00:21:14,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208208 conditions, 21265 events. 12170/21265 cut-off events. For 546665/546665 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 167430 event pairs, 1051 based on Foata normal form. 18/21281 useless extension candidates. Maximal degree in co-relation 206729. Up to 18355 conditions per place. [2022-12-06 00:21:14,211 INFO L137 encePairwiseOnDemand]: 61/77 looper letters, 1413 selfloop transitions, 77 changer transitions 18/1508 dead transitions. [2022-12-06 00:21:14,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 1508 transitions, 39887 flow [2022-12-06 00:21:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:21:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:21:14,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-12-06 00:21:14,212 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4069264069264069 [2022-12-06 00:21:14,212 INFO L175 Difference]: Start difference. First operand has 262 places, 1404 transitions, 34958 flow. Second operand 3 states and 94 transitions. [2022-12-06 00:21:14,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 1508 transitions, 39887 flow [2022-12-06 00:21:20,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1508 transitions, 39612 flow, removed 122 selfloop flow, removed 5 redundant places. [2022-12-06 00:21:20,145 INFO L231 Difference]: Finished difference. Result has 261 places, 1408 transitions, 35036 flow [2022-12-06 00:21:20,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=34486, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=35036, PETRI_PLACES=261, PETRI_TRANSITIONS=1408} [2022-12-06 00:21:20,146 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 236 predicate places. [2022-12-06 00:21:20,147 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:20,147 INFO L89 Accepts]: Start accepts. Operand has 261 places, 1408 transitions, 35036 flow [2022-12-06 00:21:20,154 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:20,155 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:20,155 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 1408 transitions, 35036 flow [2022-12-06 00:21:20,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 1408 transitions, 35036 flow [2022-12-06 00:21:22,344 INFO L130 PetriNetUnfolder]: 3086/7959 cut-off events. [2022-12-06 00:21:22,344 INFO L131 PetriNetUnfolder]: For 214593/215102 co-relation queries the response was YES. [2022-12-06 00:21:22,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76016 conditions, 7959 events. 3086/7959 cut-off events. For 214593/215102 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 79183 event pairs, 31 based on Foata normal form. 32/7910 useless extension candidates. Maximal degree in co-relation 75604. Up to 2925 conditions per place. [2022-12-06 00:21:22,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 1408 transitions, 35036 flow [2022-12-06 00:21:22,534 INFO L188 LiptonReduction]: Number of co-enabled transitions 5370 [2022-12-06 00:21:22,537 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:22,538 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2391 [2022-12-06 00:21:22,538 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 1408 transitions, 35036 flow [2022-12-06 00:21:22,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:22,538 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:22,538 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:22,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:21:22,539 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:21:22,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash -970318515, now seen corresponding path program 1 times [2022-12-06 00:21:22,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:22,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548283921] [2022-12-06 00:21:22,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:22,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:21:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:22,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548283921] [2022-12-06 00:21:22,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548283921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:22,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:22,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:21:22,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780222719] [2022-12-06 00:21:22,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:22,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:22,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:22,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:22,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:22,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 00:21:22,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 1408 transitions, 35036 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:22,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:22,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 00:21:22,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:30,630 INFO L130 PetriNetUnfolder]: 10836/18967 cut-off events. [2022-12-06 00:21:30,630 INFO L131 PetriNetUnfolder]: For 501141/501141 co-relation queries the response was YES. [2022-12-06 00:21:30,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187601 conditions, 18967 events. 10836/18967 cut-off events. For 501141/501141 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 146839 event pairs, 1250 based on Foata normal form. 4/18970 useless extension candidates. Maximal degree in co-relation 186591. Up to 18404 conditions per place. [2022-12-06 00:21:30,882 INFO L137 encePairwiseOnDemand]: 52/75 looper letters, 1194 selfloop transitions, 83 changer transitions 0/1277 dead transitions. [2022-12-06 00:21:30,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1277 transitions, 34247 flow [2022-12-06 00:21:30,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-12-06 00:21:30,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2866666666666667 [2022-12-06 00:21:30,883 INFO L175 Difference]: Start difference. First operand has 261 places, 1408 transitions, 35036 flow. Second operand 4 states and 86 transitions. [2022-12-06 00:21:30,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1277 transitions, 34247 flow [2022-12-06 00:21:35,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1277 transitions, 33875 flow, removed 114 selfloop flow, removed 4 redundant places. [2022-12-06 00:21:35,506 INFO L231 Difference]: Finished difference. Result has 259 places, 1257 transitions, 31207 flow [2022-12-06 00:21:35,508 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=30723, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=31207, PETRI_PLACES=259, PETRI_TRANSITIONS=1257} [2022-12-06 00:21:35,508 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 234 predicate places. [2022-12-06 00:21:35,508 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:35,508 INFO L89 Accepts]: Start accepts. Operand has 259 places, 1257 transitions, 31207 flow [2022-12-06 00:21:35,514 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:35,514 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:35,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 1257 transitions, 31207 flow [2022-12-06 00:21:35,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 1257 transitions, 31207 flow [2022-12-06 00:21:37,141 INFO L130 PetriNetUnfolder]: 2744/7138 cut-off events. [2022-12-06 00:21:37,141 INFO L131 PetriNetUnfolder]: For 183496/183931 co-relation queries the response was YES. [2022-12-06 00:21:37,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66690 conditions, 7138 events. 2744/7138 cut-off events. For 183496/183931 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 70137 event pairs, 23 based on Foata normal form. 16/7096 useless extension candidates. Maximal degree in co-relation 66283. Up to 2628 conditions per place. [2022-12-06 00:21:37,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 1257 transitions, 31207 flow [2022-12-06 00:21:37,278 INFO L188 LiptonReduction]: Number of co-enabled transitions 4800 [2022-12-06 00:21:37,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:21:37,282 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1774 [2022-12-06 00:21:37,282 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 1257 transitions, 31207 flow [2022-12-06 00:21:37,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:37,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:37,283 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:37,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:21:37,283 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:21:37,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 396806173, now seen corresponding path program 2 times [2022-12-06 00:21:37,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:37,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354662697] [2022-12-06 00:21:37,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:37,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354662697] [2022-12-06 00:21:37,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354662697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:21:37,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:21:37,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:21:37,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422558492] [2022-12-06 00:21:37,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:21:37,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:21:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:21:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:21:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:21:37,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 67 [2022-12-06 00:21:37,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1257 transitions, 31207 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:37,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:21:37,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 67 [2022-12-06 00:21:37,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:21:46,702 INFO L130 PetriNetUnfolder]: 13408/23314 cut-off events. [2022-12-06 00:21:46,702 INFO L131 PetriNetUnfolder]: For 585354/585354 co-relation queries the response was YES. [2022-12-06 00:21:46,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226002 conditions, 23314 events. 13408/23314 cut-off events. For 585354/585354 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 184800 event pairs, 795 based on Foata normal form. 86/23399 useless extension candidates. Maximal degree in co-relation 223880. Up to 11620 conditions per place. [2022-12-06 00:21:47,095 INFO L137 encePairwiseOnDemand]: 41/67 looper letters, 918 selfloop transitions, 886 changer transitions 3/1807 dead transitions. [2022-12-06 00:21:47,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1807 transitions, 48140 flow [2022-12-06 00:21:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:21:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:21:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-12-06 00:21:47,096 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3805970149253731 [2022-12-06 00:21:47,096 INFO L175 Difference]: Start difference. First operand has 259 places, 1257 transitions, 31207 flow. Second operand 4 states and 102 transitions. [2022-12-06 00:21:47,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1807 transitions, 48140 flow [2022-12-06 00:21:53,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1807 transitions, 46525 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-06 00:21:53,950 INFO L231 Difference]: Finished difference. Result has 256 places, 1651 transitions, 44557 flow [2022-12-06 00:21:53,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=29872, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=477, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=44557, PETRI_PLACES=256, PETRI_TRANSITIONS=1651} [2022-12-06 00:21:53,952 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 231 predicate places. [2022-12-06 00:21:53,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:21:53,952 INFO L89 Accepts]: Start accepts. Operand has 256 places, 1651 transitions, 44557 flow [2022-12-06 00:21:53,960 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:21:53,960 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:21:53,960 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 1651 transitions, 44557 flow [2022-12-06 00:21:53,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 1651 transitions, 44557 flow [2022-12-06 00:21:56,375 INFO L130 PetriNetUnfolder]: 3428/8989 cut-off events. [2022-12-06 00:21:56,375 INFO L131 PetriNetUnfolder]: For 236370/236849 co-relation queries the response was YES. [2022-12-06 00:21:56,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84709 conditions, 8989 events. 3428/8989 cut-off events. For 236370/236849 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 92264 event pairs, 5 based on Foata normal form. 21/8952 useless extension candidates. Maximal degree in co-relation 83632. Up to 3063 conditions per place. [2022-12-06 00:21:56,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 1651 transitions, 44557 flow [2022-12-06 00:21:56,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 6440 [2022-12-06 00:21:56,725 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:21:56,927 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:21:57,136 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:21:57,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [741] L79-->L59: Formula: (and (= v_~new~0_116 v_~v_old~0_181) (= (select (select |v_#memory_int_394| v_~queue~0.base_172) (+ (* v_~start~0_255 4) v_~queue~0.offset_173)) v_~new~0_116) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71| 0)) (= (ite (and (< v_~start~0_255 v_~end~0_276) (<= 0 v_~start~0_255) (< v_~start~0_255 v_~n~0_169)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|) (= (+ v_~i~0_310 1) v_~i~0_309) (= v_~last~0_151 (select (select |v_#memory_int_394| v_~A~0.base_198) (+ (* v_~i~0_310 4) v_~A~0.offset_198))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_174| 256) 0)) (= (+ v_~start~0_255 1) v_~start~0_254) (= (ite (= (ite (and (not (= (mod v_~ok~0_191 256) 0)) (<= v_~new~0_116 v_~v_old~0_182)) 1 0) 0) 0 1) v_~ok~0_190) (= |v_thread2Thread1of1ForFork1_~cond~0#1_173| (ite (= (ite (or (< v_~i~0_310 v_~N~0_223) (< v_~start~0_254 v_~end~0_276)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_255, ~A~0.base=v_~A~0.base_198, ~queue~0.offset=v_~queue~0.offset_173, ~ok~0=v_~ok~0_191, ~i~0=v_~i~0_310, ~N~0=v_~N~0_223, ~queue~0.base=v_~queue~0.base_172, ~A~0.offset=v_~A~0.offset_198, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_174|, #memory_int=|v_#memory_int_394|, ~end~0=v_~end~0_276, ~v_old~0=v_~v_old~0_182, ~n~0=v_~n~0_169} OutVars{~start~0=v_~start~0_254, ~new~0=v_~new~0_116, ~A~0.base=v_~A~0.base_198, ~queue~0.offset=v_~queue~0.offset_173, ~ok~0=v_~ok~0_190, ~i~0=v_~i~0_309, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_71|, ~N~0=v_~N~0_223, ~queue~0.base=v_~queue~0.base_172, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_71|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_125|, ~A~0.offset=v_~A~0.offset_198, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_71|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_173|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_68|, #memory_int=|v_#memory_int_394|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_71|, ~end~0=v_~end~0_276, ~v_old~0=v_~v_old~0_181, ~n~0=v_~n~0_169, ~last~0=v_~last~0_151} AuxVars[] AssignedVars[~start~0, ~new~0, ~ok~0, ~i~0, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, ~v_old~0, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:21:57,347 WARN L322 ript$VariableManager]: TermVariable LBE74 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:57,347 WARN L322 ript$VariableManager]: TermVariable LBE304 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 00:21:57,631 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:21:57,824 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:21:58,013 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:21:58,013 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4061 [2022-12-06 00:21:58,014 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 1651 transitions, 44631 flow [2022-12-06 00:21:58,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:21:58,014 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:21:58,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:21:58,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 00:21:58,014 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:21:58,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:21:58,014 INFO L85 PathProgramCache]: Analyzing trace with hash 824022641, now seen corresponding path program 3 times [2022-12-06 00:21:58,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:21:58,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916318590] [2022-12-06 00:21:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:21:58,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:21:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:21:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:21:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:21:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916318590] [2022-12-06 00:21:59,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916318590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:21:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492482097] [2022-12-06 00:21:59,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 00:21:59,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:21:59,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:21:59,984 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:21:59,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 00:22:00,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 00:22:00,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:22:00,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 00:22:00,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:22:00,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:00,168 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 14 treesize of output 16 [2022-12-06 00:22:00,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:22:00,225 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 14 treesize of output 16 [2022-12-06 00:22:00,386 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 00:22:00,387 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 34 treesize of output 10 [2022-12-06 00:22:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:22:00,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:22:04,739 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse2 (* c_~end~0 4))) (and (or (not (= (mod c_~ok~0 256) 0)) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_895 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_895))) (= (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset))))))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_895 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_895))) (let ((.cse4 (select .cse3 ~queue~0.base))) (or (not (= (select (select .cse3 c_~A~0.base) .cse1) (select .cse4 (+ .cse2 ~queue~0.offset)))) (< (select .cse4 (+ (* c_~start~0 4) ~queue~0.offset)) (+ c_~v_old~0 1)))))))) is different from false [2022-12-06 00:22:04,863 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:04,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1369 treesize of output 1319 [2022-12-06 00:22:04,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:04,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1160 treesize of output 1097 [2022-12-06 00:22:04,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:04,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1052 treesize of output 987 [2022-12-06 00:22:05,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:22:05,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 902 treesize of output 727 [2022-12-06 00:22:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 00:22:34,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492482097] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:22:34,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:22:34,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 20 [2022-12-06 00:22:34,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390229928] [2022-12-06 00:22:34,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:22:34,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 00:22:34,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:22:34,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 00:22:34,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=318, Unknown=2, NotChecked=38, Total=462 [2022-12-06 00:22:34,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 75 [2022-12-06 00:22:34,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 1651 transitions, 44631 flow. Second operand has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:22:34,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:22:34,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 75 [2022-12-06 00:22:34,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:22:48,477 INFO L130 PetriNetUnfolder]: 15944/27664 cut-off events. [2022-12-06 00:22:48,478 INFO L131 PetriNetUnfolder]: For 778368/778368 co-relation queries the response was YES. [2022-12-06 00:22:48,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279638 conditions, 27664 events. 15944/27664 cut-off events. For 778368/778368 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 225017 event pairs, 1493 based on Foata normal form. 5/27668 useless extension candidates. Maximal degree in co-relation 276881. Up to 11785 conditions per place. [2022-12-06 00:22:49,086 INFO L137 encePairwiseOnDemand]: 28/75 looper letters, 988 selfloop transitions, 1148 changer transitions 25/2161 dead transitions. [2022-12-06 00:22:49,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 2161 transitions, 60819 flow [2022-12-06 00:22:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:22:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:22:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 187 transitions. [2022-12-06 00:22:49,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15583333333333332 [2022-12-06 00:22:49,088 INFO L175 Difference]: Start difference. First operand has 256 places, 1651 transitions, 44631 flow. Second operand 16 states and 187 transitions. [2022-12-06 00:22:49,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 2161 transitions, 60819 flow [2022-12-06 00:22:56,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 2161 transitions, 59954 flow, removed 385 selfloop flow, removed 1 redundant places. [2022-12-06 00:22:56,800 INFO L231 Difference]: Finished difference. Result has 279 places, 1941 transitions, 56146 flow [2022-12-06 00:22:56,801 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=43972, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=866, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=56146, PETRI_PLACES=279, PETRI_TRANSITIONS=1941} [2022-12-06 00:22:56,801 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 254 predicate places. [2022-12-06 00:22:56,802 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:22:56,802 INFO L89 Accepts]: Start accepts. Operand has 279 places, 1941 transitions, 56146 flow [2022-12-06 00:22:56,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:22:56,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:22:56,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 1941 transitions, 56146 flow [2022-12-06 00:22:56,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 1941 transitions, 56146 flow [2022-12-06 00:23:00,254 INFO L130 PetriNetUnfolder]: 4134/10725 cut-off events. [2022-12-06 00:23:00,254 INFO L131 PetriNetUnfolder]: For 321865/322424 co-relation queries the response was YES. [2022-12-06 00:23:00,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107661 conditions, 10725 events. 4134/10725 cut-off events. For 321865/322424 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 113209 event pairs, 11 based on Foata normal form. 29/10690 useless extension candidates. Maximal degree in co-relation 107534. Up to 3746 conditions per place. [2022-12-06 00:23:00,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 1941 transitions, 56146 flow [2022-12-06 00:23:00,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 7586 [2022-12-06 00:23:00,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [709] $Ultimate##0-->L59: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= |v_thread2Thread1of1ForFork1_~cond~0#1_100| (ite (= (ite (or (< v_~i~0_223 v_~N~0_183) (< v_~start~0_180 v_~end~0_238)) 1 0) 0) 0 1)) (= (ite (= (ite (and (not (= (mod v_~ok~0_119 256) 0)) (<= v_~new~0_77 v_~v_old~0_110)) 1 0) 0) 0 1) v_~ok~0_118) (= (ite (and (< v_~start~0_181 v_~n~0_135) (<= 0 v_~start~0_181) (< v_~start~0_181 v_~end~0_238)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= v_~i~0_222 (+ v_~i~0_223 1)) (= v_~new~0_77 (select (select |v_#memory_int_323| v_~queue~0.base_138) (+ (* v_~start~0_181 4) v_~queue~0.offset_139))) (= v_~new~0_77 v_~v_old~0_109) (= (+ v_~start~0_181 1) v_~start~0_180)) InVars {~start~0=v_~start~0_181, ~queue~0.offset=v_~queue~0.offset_139, ~ok~0=v_~ok~0_119, ~i~0=v_~i~0_223, #memory_int=|v_#memory_int_323|, ~end~0=v_~end~0_238, ~N~0=v_~N~0_183, ~v_old~0=v_~v_old~0_110, ~queue~0.base=v_~queue~0.base_138, ~n~0=v_~n~0_135} OutVars{~start~0=v_~start~0_180, ~new~0=v_~new~0_77, ~queue~0.offset=v_~queue~0.offset_139, ~ok~0=v_~ok~0_118, ~i~0=v_~i~0_222, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~N~0=v_~N~0_183, ~queue~0.base=v_~queue~0.base_138, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_58|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_33|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_100|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_40|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_33|, #memory_int=|v_#memory_int_323|, ~end~0=v_~end~0_238, ~v_old~0=v_~v_old~0_109, ~n~0=v_~n~0_135} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:00,775 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [729] $Ultimate##0-->L79: Formula: (and (= v_~new~0_102 v_~v_old~0_157) (= |v_thread2Thread1of1ForFork1_~cond~0#1_149| (ite (= (ite (or (< v_~start~0_228 v_~end~0_262) (< v_~i~0_279 v_~N~0_209)) 1 0) 0) 0 1)) (= v_~ok~0_166 (ite (= (ite (and (not (= (mod v_~ok~0_167 256) 0)) (<= v_~new~0_102 v_~v_old~0_158)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= v_~start~0_228 (+ v_~start~0_229 1)) (= (ite (and (<= 0 v_~start~0_229) (< v_~start~0_229 v_~end~0_262) (< v_~start~0_229 v_~n~0_157)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= v_~new~0_102 (select (select |v_#memory_int_368| v_~queue~0.base_160) (+ (* v_~start~0_229 4) v_~queue~0.offset_161)))) InVars {~start~0=v_~start~0_229, ~queue~0.offset=v_~queue~0.offset_161, ~ok~0=v_~ok~0_167, ~i~0=v_~i~0_279, #memory_int=|v_#memory_int_368|, ~end~0=v_~end~0_262, ~N~0=v_~N~0_209, ~v_old~0=v_~v_old~0_158, ~queue~0.base=v_~queue~0.base_160, ~n~0=v_~n~0_157} OutVars{~start~0=v_~start~0_228, ~new~0=v_~new~0_102, ~queue~0.offset=v_~queue~0.offset_161, ~ok~0=v_~ok~0_166, ~i~0=v_~i~0_279, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, ~N~0=v_~N~0_209, ~queue~0.base=v_~queue~0.base_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_59|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_149|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_59|, #memory_int=|v_#memory_int_368|, ~end~0=v_~end~0_262, ~v_old~0=v_~v_old~0_157, ~n~0=v_~n~0_157} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:00,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [754] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_200| (ite (= (ite (or (< v_~start~0_283 v_~end~0_293) (< v_~i~0_348 v_~N~0_239)) 1 0) 0) 0 1)) (= v_~i~0_347 (+ v_~i~0_348 1))) InVars {~start~0=v_~start~0_283, ~i~0=v_~i~0_348, ~end~0=v_~end~0_293, ~N~0=v_~N~0_239} OutVars{~start~0=v_~start~0_283, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_158|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_200|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_80|, ~i~0=v_~i~0_347, ~end~0=v_~end~0_293, ~N~0=v_~N~0_239} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:00,960 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,064 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [755] $Ultimate##0-->L59: Formula: (and (= (+ v_~i~0_352 1) v_~i~0_351) (= |v_thread2Thread1of1ForFork1_~cond~0#1_202| (ite (= (ite (or (< v_~start~0_285 v_~end~0_295) (< v_~i~0_352 v_~N~0_241)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_285, ~i~0=v_~i~0_352, ~end~0=v_~end~0_295, ~N~0=v_~N~0_241} OutVars{~start~0=v_~start~0_285, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_160|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_202|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_82|, ~i~0=v_~i~0_351, ~end~0=v_~end~0_295, ~N~0=v_~N~0_241} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:01,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [755] $Ultimate##0-->L59: Formula: (and (= (+ v_~i~0_352 1) v_~i~0_351) (= |v_thread2Thread1of1ForFork1_~cond~0#1_202| (ite (= (ite (or (< v_~start~0_285 v_~end~0_295) (< v_~i~0_352 v_~N~0_241)) 1 0) 0) 0 1))) InVars {~start~0=v_~start~0_285, ~i~0=v_~i~0_352, ~end~0=v_~end~0_295, ~N~0=v_~N~0_241} OutVars{~start~0=v_~start~0_285, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_160|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_202|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_82|, ~i~0=v_~i~0_351, ~end~0=v_~end~0_295, ~N~0=v_~N~0_241} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:01,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,314 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:23:01,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,440 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,674 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [712] L79-->L59: Formula: (and (= (+ v_~start~0_193 1) v_~start~0_192) (= (ite (= (ite (and (not (= (mod v_~ok~0_131 256) 0)) (<= v_~new~0_83 v_~v_old~0_122)) 1 0) 0) 0 1) v_~ok~0_130) (= v_~new~0_83 (select (select |v_#memory_int_329| v_~queue~0.base_144) (+ v_~queue~0.offset_145 (* v_~start~0_193 4)))) (= (ite (and (< v_~start~0_193 v_~end~0_244) (< v_~start~0_193 v_~n~0_141) (<= 0 v_~start~0_193)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_109| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (= (+ v_~i~0_235 1) v_~i~0_234) (= |v_thread2Thread1of1ForFork1_~cond~0#1_108| (ite (= (ite (or (< v_~start~0_192 v_~end~0_244) (< v_~i~0_235 v_~N~0_189)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (= v_~new~0_83 v_~v_old~0_121)) InVars {~start~0=v_~start~0_193, ~queue~0.offset=v_~queue~0.offset_145, ~ok~0=v_~ok~0_131, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_109|, ~i~0=v_~i~0_235, #memory_int=|v_#memory_int_329|, ~end~0=v_~end~0_244, ~N~0=v_~N~0_189, ~v_old~0=v_~v_old~0_122, ~queue~0.base=v_~queue~0.base_144, ~n~0=v_~n~0_141} OutVars{~start~0=v_~start~0_192, ~new~0=v_~new~0_83, ~queue~0.offset=v_~queue~0.offset_145, ~ok~0=v_~ok~0_130, ~i~0=v_~i~0_234, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~N~0=v_~N~0_189, ~queue~0.base=v_~queue~0.base_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_64|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_39|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_108|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_46|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_39|, #memory_int=|v_#memory_int_329|, ~end~0=v_~end~0_244, ~v_old~0=v_~v_old~0_121, ~n~0=v_~n~0_141} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,776 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:23:01,828 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [713] L79-->L59: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_113| 256) 0)) (= (+ v_~start~0_197 1) v_~start~0_196) (= (select (select |v_#memory_int_331| v_~queue~0.base_146) (+ v_~queue~0.offset_147 (* v_~start~0_197 4))) v_~new~0_85) (= v_~new~0_85 v_~v_old~0_125) (= (+ v_~i~0_239 1) v_~i~0_238) (= (ite (and (<= 0 v_~start~0_197) (< v_~start~0_197 v_~end~0_246) (< v_~start~0_197 v_~n~0_143)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_~cond~0#1_112| (ite (= 0 (ite (or (< v_~i~0_239 v_~N~0_191) (< v_~start~0_196 v_~end~0_246)) 1 0)) 0 1)) (= (ite (= (ite (and (<= v_~new~0_85 v_~v_old~0_126) (not (= (mod v_~ok~0_135 256) 0))) 1 0) 0) 0 1) v_~ok~0_134)) InVars {~start~0=v_~start~0_197, ~queue~0.offset=v_~queue~0.offset_147, ~ok~0=v_~ok~0_135, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_113|, ~i~0=v_~i~0_239, #memory_int=|v_#memory_int_331|, ~end~0=v_~end~0_246, ~N~0=v_~N~0_191, ~v_old~0=v_~v_old~0_126, ~queue~0.base=v_~queue~0.base_146, ~n~0=v_~n~0_143} OutVars{~start~0=v_~start~0_196, ~new~0=v_~new~0_85, ~queue~0.offset=v_~queue~0.offset_147, ~ok~0=v_~ok~0_134, ~i~0=v_~i~0_238, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~N~0=v_~N~0_191, ~queue~0.base=v_~queue~0.base_146, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_66|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_41|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_112|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_48|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, #memory_int=|v_#memory_int_331|, ~end~0=v_~end~0_246, ~v_old~0=v_~v_old~0_125, ~n~0=v_~n~0_143} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:01,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [711] L79-->L59: Formula: (and (= (+ v_~i~0_231 1) v_~i~0_230) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|) (= v_~new~0_81 (select (select |v_#memory_int_327| v_~queue~0.base_142) (+ (* v_~start~0_189 4) v_~queue~0.offset_143))) (= |v_thread2Thread1of1ForFork1_~cond~0#1_104| (ite (= (ite (or (< v_~i~0_231 v_~N~0_187) (< v_~start~0_188 v_~end~0_242)) 1 0) 0) 0 1)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_105| 256) 0)) (= (ite (= (ite (and (<= v_~new~0_81 v_~v_old~0_118) (not (= (mod v_~ok~0_127 256) 0))) 1 0) 0) 0 1) v_~ok~0_126) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) (= (+ v_~start~0_189 1) v_~start~0_188) (= v_~new~0_81 v_~v_old~0_117) (= (ite (and (< v_~start~0_189 v_~n~0_139) (<= 0 v_~start~0_189) (< v_~start~0_189 v_~end~0_242)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|)) InVars {~start~0=v_~start~0_189, ~queue~0.offset=v_~queue~0.offset_143, ~ok~0=v_~ok~0_127, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_105|, ~i~0=v_~i~0_231, #memory_int=|v_#memory_int_327|, ~end~0=v_~end~0_242, ~N~0=v_~N~0_187, ~v_old~0=v_~v_old~0_118, ~queue~0.base=v_~queue~0.base_142, ~n~0=v_~n~0_139} OutVars{~start~0=v_~start~0_188, ~new~0=v_~new~0_81, ~queue~0.offset=v_~queue~0.offset_143, ~ok~0=v_~ok~0_126, ~i~0=v_~i~0_230, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|, ~N~0=v_~N~0_187, ~queue~0.base=v_~queue~0.base_142, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_62|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_37|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_104|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_44|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_37|, #memory_int=|v_#memory_int_327|, ~end~0=v_~end~0_242, ~v_old~0=v_~v_old~0_117, ~n~0=v_~n~0_139} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 00:23:02,057 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [712] L79-->L59: Formula: (and (= (+ v_~start~0_193 1) v_~start~0_192) (= (ite (= (ite (and (not (= (mod v_~ok~0_131 256) 0)) (<= v_~new~0_83 v_~v_old~0_122)) 1 0) 0) 0 1) v_~ok~0_130) (= v_~new~0_83 (select (select |v_#memory_int_329| v_~queue~0.base_144) (+ v_~queue~0.offset_145 (* v_~start~0_193 4)))) (= (ite (and (< v_~start~0_193 v_~end~0_244) (< v_~start~0_193 v_~n~0_141) (<= 0 v_~start~0_193)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_109| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| 0)) (= (+ v_~i~0_235 1) v_~i~0_234) (= |v_thread2Thread1of1ForFork1_~cond~0#1_108| (ite (= (ite (or (< v_~start~0_192 v_~end~0_244) (< v_~i~0_235 v_~N~0_189)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_39| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|) (= v_~new~0_83 v_~v_old~0_121)) InVars {~start~0=v_~start~0_193, ~queue~0.offset=v_~queue~0.offset_145, ~ok~0=v_~ok~0_131, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_109|, ~i~0=v_~i~0_235, #memory_int=|v_#memory_int_329|, ~end~0=v_~end~0_244, ~N~0=v_~N~0_189, ~v_old~0=v_~v_old~0_122, ~queue~0.base=v_~queue~0.base_144, ~n~0=v_~n~0_141} OutVars{~start~0=v_~start~0_192, ~new~0=v_~new~0_83, ~queue~0.offset=v_~queue~0.offset_145, ~ok~0=v_~ok~0_130, ~i~0=v_~i~0_234, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_39|, ~N~0=v_~N~0_189, ~queue~0.base=v_~queue~0.base_144, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_39|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_64|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_39|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_108|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_46|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_39|, #memory_int=|v_#memory_int_329|, ~end~0=v_~end~0_244, ~v_old~0=v_~v_old~0_121, ~n~0=v_~n~0_141} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,195 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [713] L79-->L59: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_113| 256) 0)) (= (+ v_~start~0_197 1) v_~start~0_196) (= (select (select |v_#memory_int_331| v_~queue~0.base_146) (+ v_~queue~0.offset_147 (* v_~start~0_197 4))) v_~new~0_85) (= v_~new~0_85 v_~v_old~0_125) (= (+ v_~i~0_239 1) v_~i~0_238) (= (ite (and (<= 0 v_~start~0_197) (< v_~start~0_197 v_~end~0_246) (< v_~start~0_197 v_~n~0_143)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|) (= |v_thread2Thread1of1ForFork1_~cond~0#1_112| (ite (= 0 (ite (or (< v_~i~0_239 v_~N~0_191) (< v_~start~0_196 v_~end~0_246)) 1 0)) 0 1)) (= (ite (= (ite (and (<= v_~new~0_85 v_~v_old~0_126) (not (= (mod v_~ok~0_135 256) 0))) 1 0) 0) 0 1) v_~ok~0_134)) InVars {~start~0=v_~start~0_197, ~queue~0.offset=v_~queue~0.offset_147, ~ok~0=v_~ok~0_135, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_113|, ~i~0=v_~i~0_239, #memory_int=|v_#memory_int_331|, ~end~0=v_~end~0_246, ~N~0=v_~N~0_191, ~v_old~0=v_~v_old~0_126, ~queue~0.base=v_~queue~0.base_146, ~n~0=v_~n~0_143} OutVars{~start~0=v_~start~0_196, ~new~0=v_~new~0_85, ~queue~0.offset=v_~queue~0.offset_147, ~ok~0=v_~ok~0_134, ~i~0=v_~i~0_238, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_41|, ~N~0=v_~N~0_191, ~queue~0.base=v_~queue~0.base_146, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_41|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_66|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_41|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_112|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_48|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_41|, #memory_int=|v_#memory_int_331|, ~end~0=v_~end~0_246, ~v_old~0=v_~v_old~0_125, ~n~0=v_~n~0_143} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [753] $Ultimate##0-->L79: Formula: (and (= v_~new~0_131 v_~v_old~0_207) (= (ite (and (< v_~start~0_280 v_~n~0_183) (<= 0 v_~start~0_280) (< v_~start~0_280 v_~end~0_291)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_196| (ite (= 0 (ite (or (< v_~i~0_345 v_~N~0_237) (< v_~start~0_279 v_~end~0_291)) 1 0)) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (= (ite (= (ite (and (<= v_~new~0_131 v_~v_old~0_208) (not (= (mod v_~ok~0_217 256) 0))) 1 0) 0) 0 1) v_~ok~0_216) (= (+ v_~start~0_280 1) v_~start~0_279) (= v_~new~0_131 (select (select |v_#memory_int_431| v_~queue~0.base_189) (+ (* v_~start~0_280 4) v_~queue~0.offset_190)))) InVars {~start~0=v_~start~0_280, ~queue~0.offset=v_~queue~0.offset_190, ~ok~0=v_~ok~0_217, ~i~0=v_~i~0_345, #memory_int=|v_#memory_int_431|, ~end~0=v_~end~0_291, ~N~0=v_~N~0_237, ~v_old~0=v_~v_old~0_208, ~queue~0.base=v_~queue~0.base_189, ~n~0=v_~n~0_183} OutVars{~start~0=v_~start~0_279, ~new~0=v_~new~0_131, ~queue~0.offset=v_~queue~0.offset_190, ~ok~0=v_~ok~0_216, ~i~0=v_~i~0_345, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, ~N~0=v_~N~0_237, ~queue~0.base=v_~queue~0.base_189, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_83|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_196|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_83|, #memory_int=|v_#memory_int_431|, ~end~0=v_~end~0_291, ~v_old~0=v_~v_old~0_207, ~n~0=v_~n~0_183} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,368 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:23:02,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [753] $Ultimate##0-->L79: Formula: (and (= v_~new~0_131 v_~v_old~0_207) (= (ite (and (< v_~start~0_280 v_~n~0_183) (<= 0 v_~start~0_280) (< v_~start~0_280 v_~end~0_291)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_196| (ite (= 0 (ite (or (< v_~i~0_345 v_~N~0_237) (< v_~start~0_279 v_~end~0_291)) 1 0)) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (= (ite (= (ite (and (<= v_~new~0_131 v_~v_old~0_208) (not (= (mod v_~ok~0_217 256) 0))) 1 0) 0) 0 1) v_~ok~0_216) (= (+ v_~start~0_280 1) v_~start~0_279) (= v_~new~0_131 (select (select |v_#memory_int_431| v_~queue~0.base_189) (+ (* v_~start~0_280 4) v_~queue~0.offset_190)))) InVars {~start~0=v_~start~0_280, ~queue~0.offset=v_~queue~0.offset_190, ~ok~0=v_~ok~0_217, ~i~0=v_~i~0_345, #memory_int=|v_#memory_int_431|, ~end~0=v_~end~0_291, ~N~0=v_~N~0_237, ~v_old~0=v_~v_old~0_208, ~queue~0.base=v_~queue~0.base_189, ~n~0=v_~n~0_183} OutVars{~start~0=v_~start~0_279, ~new~0=v_~new~0_131, ~queue~0.offset=v_~queue~0.offset_190, ~ok~0=v_~ok~0_216, ~i~0=v_~i~0_345, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, ~N~0=v_~N~0_237, ~queue~0.base=v_~queue~0.base_189, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_83|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_196|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_83|, #memory_int=|v_#memory_int_431|, ~end~0=v_~end~0_291, ~v_old~0=v_~v_old~0_207, ~n~0=v_~n~0_183} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,493 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [711] L79-->L59: Formula: (and (= (+ v_~i~0_231 1) v_~i~0_230) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|) (= v_~new~0_81 (select (select |v_#memory_int_327| v_~queue~0.base_142) (+ (* v_~start~0_189 4) v_~queue~0.offset_143))) (= |v_thread2Thread1of1ForFork1_~cond~0#1_104| (ite (= (ite (or (< v_~i~0_231 v_~N~0_187) (< v_~start~0_188 v_~end~0_242)) 1 0) 0) 0 1)) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_105| 256) 0)) (= (ite (= (ite (and (<= v_~new~0_81 v_~v_old~0_118) (not (= (mod v_~ok~0_127 256) 0))) 1 0) 0) 0 1) v_~ok~0_126) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37| 0)) (= (+ v_~start~0_189 1) v_~start~0_188) (= v_~new~0_81 v_~v_old~0_117) (= (ite (and (< v_~start~0_189 v_~n~0_139) (<= 0 v_~start~0_189) (< v_~start~0_189 v_~end~0_242)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|)) InVars {~start~0=v_~start~0_189, ~queue~0.offset=v_~queue~0.offset_143, ~ok~0=v_~ok~0_127, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_105|, ~i~0=v_~i~0_231, #memory_int=|v_#memory_int_327|, ~end~0=v_~end~0_242, ~N~0=v_~N~0_187, ~v_old~0=v_~v_old~0_118, ~queue~0.base=v_~queue~0.base_142, ~n~0=v_~n~0_139} OutVars{~start~0=v_~start~0_188, ~new~0=v_~new~0_81, ~queue~0.offset=v_~queue~0.offset_143, ~ok~0=v_~ok~0_126, ~i~0=v_~i~0_230, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_37|, ~N~0=v_~N~0_187, ~queue~0.base=v_~queue~0.base_142, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_37|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_62|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_37|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_104|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_44|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_37|, #memory_int=|v_#memory_int_327|, ~end~0=v_~end~0_242, ~v_old~0=v_~v_old~0_117, ~n~0=v_~n~0_139} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,587 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:23:02,660 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [730] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_153| (ite (= (ite (or (< v_~start~0_232 v_~end~0_264) (< v_~i~0_282 v_~N~0_211)) 1 0) 0) 0 1)) (= (+ v_~i~0_282 1) v_~i~0_281)) InVars {~start~0=v_~start~0_232, ~i~0=v_~i~0_282, ~end~0=v_~end~0_264, ~N~0=v_~N~0_211} OutVars{~start~0=v_~start~0_232, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_101|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_153|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_60|, ~i~0=v_~i~0_281, ~end~0=v_~end~0_264, ~N~0=v_~N~0_211} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:02,683 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:02,890 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:23:02,956 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [703] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_80| (ite (= 0 (ite (or (< v_~i~0_201 v_~N~0_171) (< v_~start~0_161 v_~end~0_216)) 1 0)) 0 1)) (= (+ v_~i~0_201 1) v_~i~0_200)) InVars {~start~0=v_~start~0_161, ~i~0=v_~i~0_201, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} OutVars{~start~0=v_~start~0_161, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_80|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_31|, ~i~0=v_~i~0_200, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:02,982 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [710] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_102| (ite (= (ite (or (< v_~start~0_184 v_~end~0_240) (< v_~i~0_227 v_~N~0_185)) 1 0) 0) 0 1)) (= (+ v_~start~0_185 1) v_~start~0_184) (= (ite (= (ite (and (not (= (mod v_~ok~0_123 256) 0)) (<= v_~new~0_79 v_~v_old~0_114)) 1 0) 0) 0 1) v_~ok~0_122) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~new~0_79 (select (select |v_#memory_int_325| v_~queue~0.base_140) (+ (* v_~start~0_185 4) v_~queue~0.offset_141))) (= (ite (and (< v_~start~0_185 v_~end~0_240) (<= 0 v_~start~0_185) (< v_~start~0_185 v_~n~0_137)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= v_~new~0_79 v_~v_old~0_113) (= (+ v_~i~0_227 1) v_~i~0_226)) InVars {~start~0=v_~start~0_185, ~queue~0.offset=v_~queue~0.offset_141, ~ok~0=v_~ok~0_123, ~i~0=v_~i~0_227, #memory_int=|v_#memory_int_325|, ~end~0=v_~end~0_240, ~N~0=v_~N~0_185, ~v_old~0=v_~v_old~0_114, ~queue~0.base=v_~queue~0.base_140, ~n~0=v_~n~0_137} OutVars{~start~0=v_~start~0_184, ~new~0=v_~new~0_79, ~queue~0.offset=v_~queue~0.offset_141, ~ok~0=v_~ok~0_122, ~i~0=v_~i~0_226, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~N~0=v_~N~0_185, ~queue~0.base=v_~queue~0.base_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_60|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_35|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_102|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_42|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_35|, #memory_int=|v_#memory_int_325|, ~end~0=v_~end~0_240, ~v_old~0=v_~v_old~0_113, ~n~0=v_~n~0_137} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:03,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [756] $Ultimate##0-->L79: Formula: (and (= (ite (= (ite (or (< v_~start~0_287 v_~end~0_297) (< v_~i~0_355 v_~N~0_243)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_204|) (= (ite (= (ite (and (<= v_~new~0_133 v_~v_old~0_212) (not (= (mod v_~ok~0_221 256) 0))) 1 0) 0) 0 1) v_~ok~0_220) (= (+ v_~start~0_288 1) v_~start~0_287) (= v_~new~0_133 v_~v_old~0_211) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_85| 0)) (= (ite (and (< v_~start~0_288 v_~n~0_185) (<= 0 v_~start~0_288) (< v_~start~0_288 v_~end~0_297)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_85| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|) (= v_~new~0_133 (select (select |v_#memory_int_433| v_~queue~0.base_191) (+ (* v_~start~0_288 4) v_~queue~0.offset_192)))) InVars {~start~0=v_~start~0_288, ~queue~0.offset=v_~queue~0.offset_192, ~ok~0=v_~ok~0_221, ~i~0=v_~i~0_355, #memory_int=|v_#memory_int_433|, ~end~0=v_~end~0_297, ~N~0=v_~N~0_243, ~v_old~0=v_~v_old~0_212, ~queue~0.base=v_~queue~0.base_191, ~n~0=v_~n~0_185} OutVars{~start~0=v_~start~0_287, ~new~0=v_~new~0_133, ~queue~0.offset=v_~queue~0.offset_192, ~ok~0=v_~ok~0_220, ~i~0=v_~i~0_355, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_85|, ~N~0=v_~N~0_243, ~queue~0.base=v_~queue~0.base_191, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_85|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_85|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_204|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_85|, #memory_int=|v_#memory_int_433|, ~end~0=v_~end~0_297, ~v_old~0=v_~v_old~0_211, ~n~0=v_~n~0_185} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:03,168 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [709] $Ultimate##0-->L59: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= |v_thread2Thread1of1ForFork1_~cond~0#1_100| (ite (= (ite (or (< v_~i~0_223 v_~N~0_183) (< v_~start~0_180 v_~end~0_238)) 1 0) 0) 0 1)) (= (ite (= (ite (and (not (= (mod v_~ok~0_119 256) 0)) (<= v_~new~0_77 v_~v_old~0_110)) 1 0) 0) 0 1) v_~ok~0_118) (= (ite (and (< v_~start~0_181 v_~n~0_135) (<= 0 v_~start~0_181) (< v_~start~0_181 v_~end~0_238)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|) (= v_~i~0_222 (+ v_~i~0_223 1)) (= v_~new~0_77 (select (select |v_#memory_int_323| v_~queue~0.base_138) (+ (* v_~start~0_181 4) v_~queue~0.offset_139))) (= v_~new~0_77 v_~v_old~0_109) (= (+ v_~start~0_181 1) v_~start~0_180)) InVars {~start~0=v_~start~0_181, ~queue~0.offset=v_~queue~0.offset_139, ~ok~0=v_~ok~0_119, ~i~0=v_~i~0_223, #memory_int=|v_#memory_int_323|, ~end~0=v_~end~0_238, ~N~0=v_~N~0_183, ~v_old~0=v_~v_old~0_110, ~queue~0.base=v_~queue~0.base_138, ~n~0=v_~n~0_135} OutVars{~start~0=v_~start~0_180, ~new~0=v_~new~0_77, ~queue~0.offset=v_~queue~0.offset_139, ~ok~0=v_~ok~0_118, ~i~0=v_~i~0_222, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_33|, ~N~0=v_~N~0_183, ~queue~0.base=v_~queue~0.base_138, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_33|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_58|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_33|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_100|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_40|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_33|, #memory_int=|v_#memory_int_323|, ~end~0=v_~end~0_238, ~v_old~0=v_~v_old~0_109, ~n~0=v_~n~0_135} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:03,254 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 00:23:03,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [703] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_80| (ite (= 0 (ite (or (< v_~i~0_201 v_~N~0_171) (< v_~start~0_161 v_~end~0_216)) 1 0)) 0 1)) (= (+ v_~i~0_201 1) v_~i~0_200)) InVars {~start~0=v_~start~0_161, ~i~0=v_~i~0_201, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} OutVars{~start~0=v_~start~0_161, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_80|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_31|, ~i~0=v_~i~0_200, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:03,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [703] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_80| (ite (= 0 (ite (or (< v_~i~0_201 v_~N~0_171) (< v_~start~0_161 v_~end~0_216)) 1 0)) 0 1)) (= (+ v_~i~0_201 1) v_~i~0_200)) InVars {~start~0=v_~start~0_161, ~i~0=v_~i~0_201, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} OutVars{~start~0=v_~start~0_161, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_80|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_31|, ~i~0=v_~i~0_200, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:03,362 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [710] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_102| (ite (= (ite (or (< v_~start~0_184 v_~end~0_240) (< v_~i~0_227 v_~N~0_185)) 1 0) 0) 0 1)) (= (+ v_~start~0_185 1) v_~start~0_184) (= (ite (= (ite (and (not (= (mod v_~ok~0_123 256) 0)) (<= v_~new~0_79 v_~v_old~0_114)) 1 0) 0) 0 1) v_~ok~0_122) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35| 0)) (= v_~new~0_79 (select (select |v_#memory_int_325| v_~queue~0.base_140) (+ (* v_~start~0_185 4) v_~queue~0.offset_141))) (= (ite (and (< v_~start~0_185 v_~end~0_240) (<= 0 v_~start~0_185) (< v_~start~0_185 v_~n~0_137)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|) (= v_~new~0_79 v_~v_old~0_113) (= (+ v_~i~0_227 1) v_~i~0_226)) InVars {~start~0=v_~start~0_185, ~queue~0.offset=v_~queue~0.offset_141, ~ok~0=v_~ok~0_123, ~i~0=v_~i~0_227, #memory_int=|v_#memory_int_325|, ~end~0=v_~end~0_240, ~N~0=v_~N~0_185, ~v_old~0=v_~v_old~0_114, ~queue~0.base=v_~queue~0.base_140, ~n~0=v_~n~0_137} OutVars{~start~0=v_~start~0_184, ~new~0=v_~new~0_79, ~queue~0.offset=v_~queue~0.offset_141, ~ok~0=v_~ok~0_122, ~i~0=v_~i~0_226, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_35|, ~N~0=v_~N~0_185, ~queue~0.base=v_~queue~0.base_140, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_35|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_60|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_35|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_102|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_42|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_35|, #memory_int=|v_#memory_int_325|, ~end~0=v_~end~0_240, ~v_old~0=v_~v_old~0_113, ~n~0=v_~n~0_137} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:23:03,450 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [703] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_80| (ite (= 0 (ite (or (< v_~i~0_201 v_~N~0_171) (< v_~start~0_161 v_~end~0_216)) 1 0)) 0 1)) (= (+ v_~i~0_201 1) v_~i~0_200)) InVars {~start~0=v_~start~0_161, ~i~0=v_~i~0_201, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} OutVars{~start~0=v_~start~0_161, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_43|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_80|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_31|, ~i~0=v_~i~0_200, ~end~0=v_~end~0_216, ~N~0=v_~N~0_171} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:23:03,494 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:23:03,495 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6693 [2022-12-06 00:23:03,495 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 1940 transitions, 56888 flow [2022-12-06 00:23:03,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:03,495 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:03,496 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:03,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 00:23:03,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-06 00:23:03,697 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:23:03,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:03,698 INFO L85 PathProgramCache]: Analyzing trace with hash 867296122, now seen corresponding path program 1 times [2022-12-06 00:23:03,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:03,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920137310] [2022-12-06 00:23:03,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:03,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:05,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:05,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920137310] [2022-12-06 00:23:05,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920137310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:05,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274911582] [2022-12-06 00:23:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:05,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:05,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:05,859 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:05,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 00:23:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:05,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 00:23:05,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:05,984 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 18 treesize of output 16 [2022-12-06 00:23:06,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:23:06,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:23:06,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-12-06 00:23:06,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2022-12-06 00:23:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:06,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:23:06,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:06,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 297 treesize of output 369 [2022-12-06 00:23:06,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:23:06,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 247 [2022-12-06 00:23:06,743 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 162 treesize of output 150 [2022-12-06 00:23:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:23:12,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274911582] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:23:12,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:23:12,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 00:23:12,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906667754] [2022-12-06 00:23:12,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:23:12,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 00:23:12,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:12,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 00:23:12,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=285, Unknown=2, NotChecked=0, Total=380 [2022-12-06 00:23:12,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 126 [2022-12-06 00:23:12,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 1940 transitions, 56888 flow. Second operand has 20 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:12,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:12,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 126 [2022-12-06 00:23:12,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:29,504 INFO L130 PetriNetUnfolder]: 16842/29205 cut-off events. [2022-12-06 00:23:29,505 INFO L131 PetriNetUnfolder]: For 922087/922087 co-relation queries the response was YES. [2022-12-06 00:23:30,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311801 conditions, 29205 events. 16842/29205 cut-off events. For 922087/922087 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 239029 event pairs, 950 based on Foata normal form. 5/29209 useless extension candidates. Maximal degree in co-relation 311664. Up to 12485 conditions per place. [2022-12-06 00:23:30,260 INFO L137 encePairwiseOnDemand]: 30/126 looper letters, 777 selfloop transitions, 1450 changer transitions 15/2242 dead transitions. [2022-12-06 00:23:30,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 2242 transitions, 67594 flow [2022-12-06 00:23:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:23:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:23:30,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 212 transitions. [2022-12-06 00:23:30,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1402116402116402 [2022-12-06 00:23:30,261 INFO L175 Difference]: Start difference. First operand has 277 places, 1940 transitions, 56888 flow. Second operand 12 states and 212 transitions. [2022-12-06 00:23:30,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 2242 transitions, 67594 flow [2022-12-06 00:23:39,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 2242 transitions, 66647 flow, removed 472 selfloop flow, removed 3 redundant places. [2022-12-06 00:23:39,464 INFO L231 Difference]: Finished difference. Result has 289 places, 2032 transitions, 63686 flow [2022-12-06 00:23:39,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=55949, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1359, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=63686, PETRI_PLACES=289, PETRI_TRANSITIONS=2032} [2022-12-06 00:23:39,466 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 264 predicate places. [2022-12-06 00:23:39,466 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:23:39,467 INFO L89 Accepts]: Start accepts. Operand has 289 places, 2032 transitions, 63686 flow [2022-12-06 00:23:39,483 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:23:39,484 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:23:39,484 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 2032 transitions, 63686 flow [2022-12-06 00:23:39,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 2032 transitions, 63686 flow [2022-12-06 00:23:43,148 INFO L130 PetriNetUnfolder]: 4422/11409 cut-off events. [2022-12-06 00:23:43,148 INFO L131 PetriNetUnfolder]: For 385729/386348 co-relation queries the response was YES. [2022-12-06 00:23:43,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120651 conditions, 11409 events. 4422/11409 cut-off events. For 385729/386348 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 121188 event pairs, 15 based on Foata normal form. 50/11392 useless extension candidates. Maximal degree in co-relation 119427. Up to 3966 conditions per place. [2022-12-06 00:23:43,374 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 2032 transitions, 63686 flow [2022-12-06 00:23:43,374 INFO L188 LiptonReduction]: Number of co-enabled transitions 7948 [2022-12-06 00:23:43,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:23:43,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3912 [2022-12-06 00:23:43,378 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 2032 transitions, 63686 flow [2022-12-06 00:23:43,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:43,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:23:43,379 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:23:43,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 00:23:43,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:43,580 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:23:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:23:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1588260360, now seen corresponding path program 1 times [2022-12-06 00:23:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:23:43,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379107185] [2022-12-06 00:23:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:23:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:23:43,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:23:43,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379107185] [2022-12-06 00:23:43,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379107185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:23:43,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719977521] [2022-12-06 00:23:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:23:43,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:23:43,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:23:43,648 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:23:43,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 00:23:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:23:43,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 00:23:43,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:23:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 00:23:43,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:23:43,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719977521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:23:43,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:23:43,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 00:23:43,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311127168] [2022-12-06 00:23:43,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:23:43,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:23:43,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:23:43,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:23:43,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:23:43,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 126 [2022-12-06 00:23:43,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 2032 transitions, 63686 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:23:43,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:23:43,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 126 [2022-12-06 00:23:43,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:23:57,324 INFO L130 PetriNetUnfolder]: 14054/24620 cut-off events. [2022-12-06 00:23:57,324 INFO L131 PetriNetUnfolder]: For 884305/884305 co-relation queries the response was YES. [2022-12-06 00:23:57,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274258 conditions, 24620 events. 14054/24620 cut-off events. For 884305/884305 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 199287 event pairs, 4385 based on Foata normal form. 122/24741 useless extension candidates. Maximal degree in co-relation 271137. Up to 21969 conditions per place. [2022-12-06 00:23:57,872 INFO L137 encePairwiseOnDemand]: 117/126 looper letters, 1503 selfloop transitions, 0 changer transitions 299/1802 dead transitions. [2022-12-06 00:23:57,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 1802 transitions, 59074 flow [2022-12-06 00:23:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:23:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:23:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2022-12-06 00:23:57,873 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29563492063492064 [2022-12-06 00:23:57,873 INFO L175 Difference]: Start difference. First operand has 289 places, 2032 transitions, 63686 flow. Second operand 4 states and 149 transitions. [2022-12-06 00:23:57,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 1802 transitions, 59074 flow [2022-12-06 00:24:05,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 1802 transitions, 56901 flow, removed 567 selfloop flow, removed 5 redundant places. [2022-12-06 00:24:06,019 INFO L231 Difference]: Finished difference. Result has 286 places, 1503 transitions, 44435 flow [2022-12-06 00:24:06,020 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=52261, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=44435, PETRI_PLACES=286, PETRI_TRANSITIONS=1503} [2022-12-06 00:24:06,020 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 261 predicate places. [2022-12-06 00:24:06,020 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:24:06,020 INFO L89 Accepts]: Start accepts. Operand has 286 places, 1503 transitions, 44435 flow [2022-12-06 00:24:06,026 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:24:06,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:24:06,027 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 286 places, 1503 transitions, 44435 flow [2022-12-06 00:24:06,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 1503 transitions, 44435 flow [2022-12-06 00:24:08,656 INFO L130 PetriNetUnfolder]: 3327/8530 cut-off events. [2022-12-06 00:24:08,656 INFO L131 PetriNetUnfolder]: For 271500/271954 co-relation queries the response was YES. [2022-12-06 00:24:08,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86124 conditions, 8530 events. 3327/8530 cut-off events. For 271500/271954 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 85826 event pairs, 22 based on Foata normal form. 24/8495 useless extension candidates. Maximal degree in co-relation 85214. Up to 2920 conditions per place. [2022-12-06 00:24:08,843 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 1503 transitions, 44435 flow [2022-12-06 00:24:08,843 INFO L188 LiptonReduction]: Number of co-enabled transitions 6124 [2022-12-06 00:24:11,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:11,634 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [729] $Ultimate##0-->L79: Formula: (and (= v_~new~0_102 v_~v_old~0_157) (= |v_thread2Thread1of1ForFork1_~cond~0#1_149| (ite (= (ite (or (< v_~start~0_228 v_~end~0_262) (< v_~i~0_279 v_~N~0_209)) 1 0) 0) 0 1)) (= v_~ok~0_166 (ite (= (ite (and (not (= (mod v_~ok~0_167 256) 0)) (<= v_~new~0_102 v_~v_old~0_158)) 1 0) 0) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59| 0)) (= v_~start~0_228 (+ v_~start~0_229 1)) (= (ite (and (<= 0 v_~start~0_229) (< v_~start~0_229 v_~end~0_262) (< v_~start~0_229 v_~n~0_157)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|) (= v_~new~0_102 (select (select |v_#memory_int_368| v_~queue~0.base_160) (+ (* v_~start~0_229 4) v_~queue~0.offset_161)))) InVars {~start~0=v_~start~0_229, ~queue~0.offset=v_~queue~0.offset_161, ~ok~0=v_~ok~0_167, ~i~0=v_~i~0_279, #memory_int=|v_#memory_int_368|, ~end~0=v_~end~0_262, ~N~0=v_~N~0_209, ~v_old~0=v_~v_old~0_158, ~queue~0.base=v_~queue~0.base_160, ~n~0=v_~n~0_157} OutVars{~start~0=v_~start~0_228, ~new~0=v_~new~0_102, ~queue~0.offset=v_~queue~0.offset_161, ~ok~0=v_~ok~0_166, ~i~0=v_~i~0_279, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_59|, ~N~0=v_~N~0_209, ~queue~0.base=v_~queue~0.base_160, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_59|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_59|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_149|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_59|, #memory_int=|v_#memory_int_368|, ~end~0=v_~end~0_262, ~v_old~0=v_~v_old~0_157, ~n~0=v_~n~0_157} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:12,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:14,731 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:24:14,868 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [695] L101-4-->L54: Formula: (and (= (store |v_#memory_int_261| |v_ULTIMATE.start_main_~#t2~0#1.base_78| (store (select |v_#memory_int_261| |v_ULTIMATE.start_main_~#t2~0#1.base_78|) |v_ULTIMATE.start_main_~#t2~0#1.offset_76| |v_ULTIMATE.start_main_#t~pre17#1_68|)) |v_#memory_int_260|) (= |v_#pthreadsForks_99| (+ |v_#pthreadsForks_100| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| 0)) (= |v_ULTIMATE.start_main_#t~pre17#1_68| |v_#pthreadsForks_100|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (not (= (ite (and (<= 0 v_~end~0_201) (< v_~end~0_201 v_~n~0_113)) 1 0) 0)) (= v_~end~0_200 (+ v_~end~0_201 1)) (= (ite (= (select (select |v_#memory_int_260| v_~queue~0.base_106) (+ v_~queue~0.offset_107 (* v_~end~0_201 4))) (select (select |v_#memory_int_260| v_~A~0.base_130) (+ v_~A~0.offset_130 (* v_~i~0_188 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|)) InVars {~A~0.base=v_~A~0.base_130, ~queue~0.offset=v_~queue~0.offset_107, ~A~0.offset=v_~A~0.offset_130, #pthreadsForks=|v_#pthreadsForks_100|, ~i~0=v_~i~0_188, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_76|, #memory_int=|v_#memory_int_261|, ~end~0=v_~end~0_201, ~queue~0.base=v_~queue~0.base_106, ~n~0=v_~n~0_113, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} OutVars{~A~0.base=v_~A~0.base_130, ~queue~0.offset=v_~queue~0.offset_107, ~i~0=v_~i~0_188, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_76|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_43|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_43|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_68|, ~queue~0.base=v_~queue~0.base_106, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_49|, ~A~0.offset=v_~A~0.offset_130, #pthreadsForks=|v_#pthreadsForks_99|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43|, #memory_int=|v_#memory_int_260|, ~end~0=v_~end~0_200, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_43|, ~n~0=v_~n~0_113, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, ULTIMATE.start_main_#t~pre15#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 00:24:15,115 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] L54-->L59: Formula: (and (= (+ v_~i~0_298 1) v_~i~0_297) (= v_~last~0_141 (select (select |v_#memory_int_380| v_~A~0.base_188) (+ (* v_~i~0_298 4) v_~A~0.offset_188)))) InVars {~A~0.base=v_~A~0.base_188, ~A~0.offset=v_~A~0.offset_188, ~i~0=v_~i~0_298, #memory_int=|v_#memory_int_380|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_115|, ~A~0.base=v_~A~0.base_188, ~A~0.offset=v_~A~0.offset_188, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_66|, ~i~0=v_~i~0_297, #memory_int=|v_#memory_int_380|, ~last~0=v_~last~0_141} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:15,211 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] L54-->L59: Formula: (and (= (+ v_~i~0_298 1) v_~i~0_297) (= v_~last~0_141 (select (select |v_#memory_int_380| v_~A~0.base_188) (+ (* v_~i~0_298 4) v_~A~0.offset_188)))) InVars {~A~0.base=v_~A~0.base_188, ~A~0.offset=v_~A~0.offset_188, ~i~0=v_~i~0_298, #memory_int=|v_#memory_int_380|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_115|, ~A~0.base=v_~A~0.base_188, ~A~0.offset=v_~A~0.offset_188, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_66|, ~i~0=v_~i~0_297, #memory_int=|v_#memory_int_380|, ~last~0=v_~last~0_141} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:15,301 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [735] L54-->L59: Formula: (and (= (+ v_~i~0_298 1) v_~i~0_297) (= v_~last~0_141 (select (select |v_#memory_int_380| v_~A~0.base_188) (+ (* v_~i~0_298 4) v_~A~0.offset_188)))) InVars {~A~0.base=v_~A~0.base_188, ~A~0.offset=v_~A~0.offset_188, ~i~0=v_~i~0_298, #memory_int=|v_#memory_int_380|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_115|, ~A~0.base=v_~A~0.base_188, ~A~0.offset=v_~A~0.offset_188, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_66|, ~i~0=v_~i~0_297, #memory_int=|v_#memory_int_380|, ~last~0=v_~last~0_141} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:17,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:18,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [753] $Ultimate##0-->L79: Formula: (and (= v_~new~0_131 v_~v_old~0_207) (= (ite (and (< v_~start~0_280 v_~n~0_183) (<= 0 v_~start~0_280) (< v_~start~0_280 v_~end~0_291)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| 0)) (= |v_thread2Thread1of1ForFork1_~cond~0#1_196| (ite (= 0 (ite (or (< v_~i~0_345 v_~N~0_237) (< v_~start~0_279 v_~end~0_291)) 1 0)) 0 1)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|) (= (ite (= (ite (and (<= v_~new~0_131 v_~v_old~0_208) (not (= (mod v_~ok~0_217 256) 0))) 1 0) 0) 0 1) v_~ok~0_216) (= (+ v_~start~0_280 1) v_~start~0_279) (= v_~new~0_131 (select (select |v_#memory_int_431| v_~queue~0.base_189) (+ (* v_~start~0_280 4) v_~queue~0.offset_190)))) InVars {~start~0=v_~start~0_280, ~queue~0.offset=v_~queue~0.offset_190, ~ok~0=v_~ok~0_217, ~i~0=v_~i~0_345, #memory_int=|v_#memory_int_431|, ~end~0=v_~end~0_291, ~N~0=v_~N~0_237, ~v_old~0=v_~v_old~0_208, ~queue~0.base=v_~queue~0.base_189, ~n~0=v_~n~0_183} OutVars{~start~0=v_~start~0_279, ~new~0=v_~new~0_131, ~queue~0.offset=v_~queue~0.offset_190, ~ok~0=v_~ok~0_216, ~i~0=v_~i~0_345, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_83|, ~N~0=v_~N~0_237, ~queue~0.base=v_~queue~0.base_189, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_83|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_83|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_196|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_83|, #memory_int=|v_#memory_int_431|, ~end~0=v_~end~0_291, ~v_old~0=v_~v_old~0_207, ~n~0=v_~n~0_183} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:18,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 00:24:18,930 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 00:24:19,054 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 00:24:19,055 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13035 [2022-12-06 00:24:19,055 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 1496 transitions, 44661 flow [2022-12-06 00:24:19,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:19,055 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:24:19,055 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:24:19,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 00:24:19,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:19,260 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:24:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:24:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 119326870, now seen corresponding path program 1 times [2022-12-06 00:24:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:24:19,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669719169] [2022-12-06 00:24:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:24:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:20,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:20,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:24:20,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669719169] [2022-12-06 00:24:20,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669719169] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:24:20,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778475503] [2022-12-06 00:24:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:24:20,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:24:20,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:24:20,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:24:20,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 00:24:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:24:20,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 00:24:20,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:24:20,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:24:20,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 23 [2022-12-06 00:24:20,373 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 414 treesize of output 406 [2022-12-06 00:24:20,380 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 00:24:20,444 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 00:24:20,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:24:20,664 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 00:24:20,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2022-12-06 00:24:20,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:24:20,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-12-06 00:24:20,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:24:20,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:24:20,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 00:24:20,828 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:24:20,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 58 [2022-12-06 00:24:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:20,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:24:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:24:21,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778475503] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:24:21,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:24:21,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2022-12-06 00:24:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161136857] [2022-12-06 00:24:21,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:24:21,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 00:24:21,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:24:21,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 00:24:21,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=468, Unknown=3, NotChecked=0, Total=600 [2022-12-06 00:24:21,505 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 96 [2022-12-06 00:24:21,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 1496 transitions, 44661 flow. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:24:21,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:24:21,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 96 [2022-12-06 00:24:21,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:24:27,149 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 [0] [2022-12-06 00:24:29,788 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 [0] [2022-12-06 00:24:33,893 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 [0] [2022-12-06 00:24:40,729 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 [0] [2022-12-06 00:24:44,786 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 [0] [2022-12-06 00:24:52,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 00:24:54,494 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 [0] [2022-12-06 00:24:58,576 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 [0] [2022-12-06 00:25:00,591 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 [0] [2022-12-06 00:25:07,369 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 [0] [2022-12-06 00:25:09,474 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 [0] [2022-12-06 00:25:12,537 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 [0] [2022-12-06 00:25:18,135 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 [0] [2022-12-06 00:25:22,660 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 [0] [2022-12-06 00:25:24,685 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 [0] [2022-12-06 00:25:31,127 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 [0] [2022-12-06 00:25:36,152 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 [0]