/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 01:24:19,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 01:24:19,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 01:24:19,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 01:24:19,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 01:24:19,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 01:24:19,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 01:24:19,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 01:24:19,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 01:24:19,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 01:24:19,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 01:24:19,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 01:24:19,606 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 01:24:19,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 01:24:19,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 01:24:19,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 01:24:19,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 01:24:19,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 01:24:19,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 01:24:19,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 01:24:19,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 01:24:19,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 01:24:19,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 01:24:19,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 01:24:19,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 01:24:19,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 01:24:19,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 01:24:19,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 01:24:19,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 01:24:19,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 01:24:19,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 01:24:19,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 01:24:19,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 01:24:19,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 01:24:19,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 01:24:19,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 01:24:19,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 01:24:19,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 01:24:19,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 01:24:19,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 01:24:19,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 01:24:19,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 01:24:19,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 01:24:19,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 01:24:19,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 01:24:19,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 01:24:19,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 01:24:19,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 01:24:19,687 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 01:24:19,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 01:24:19,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 01:24:19,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 01:24:19,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 01:24:19,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 01:24:19,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 01:24:19,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 01:24:19,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 01:24:19,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 01:24:19,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 01:24:19,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 01:24:19,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 01:24:19,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 01:24:19,690 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 01:24:19,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 01:24:19,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 01:24:19,690 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 01:24:19,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 01:24:19,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 01:24:19,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 01:24:19,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 01:24:19,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 01:24:19,963 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 01:24:19,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-12 01:24:20,868 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 01:24:21,066 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 01:24:21,066 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2022-12-12 01:24:21,071 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f069b5706/bc8944f6977a4608a0af8412aaf03756/FLAGc789691f7 [2022-12-12 01:24:21,082 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f069b5706/bc8944f6977a4608a0af8412aaf03756 [2022-12-12 01:24:21,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 01:24:21,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 01:24:21,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 01:24:21,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 01:24:21,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 01:24:21,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6053a045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21, skipping insertion in model container [2022-12-12 01:24:21,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 01:24:21,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 01:24:21,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,231 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,235 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,244 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-send-receive.wvr.c[3107,3120] [2022-12-12 01:24:21,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 01:24:21,264 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 01:24:21,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,297 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:24:21,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:24:21,300 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-send-receive.wvr.c[3107,3120] [2022-12-12 01:24:21,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 01:24:21,314 INFO L208 MainTranslator]: Completed translation [2022-12-12 01:24:21,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21 WrapperNode [2022-12-12 01:24:21,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 01:24:21,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 01:24:21,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 01:24:21,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 01:24:21,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,360 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-12-12 01:24:21,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 01:24:21,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 01:24:21,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 01:24:21,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 01:24:21,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 01:24:21,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 01:24:21,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 01:24:21,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 01:24:21,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (1/1) ... [2022-12-12 01:24:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 01:24:21,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:24:21,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 01:24:21,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 01:24:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 01:24:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 01:24:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 01:24:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 01:24:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 01:24:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 01:24:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 01:24:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 01:24:21,466 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 01:24:21,466 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 01:24:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 01:24:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 01:24:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 01:24:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 01:24:21,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 01:24:21,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 01:24:21,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 01:24:21,469 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 01:24:21,584 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 01:24:21,585 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 01:24:21,788 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 01:24:21,878 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 01:24:21,878 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 01:24:21,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:24:21 BoogieIcfgContainer [2022-12-12 01:24:21,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 01:24:21,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 01:24:21,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 01:24:21,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 01:24:21,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:24:21" (1/3) ... [2022-12-12 01:24:21,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8f9197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:24:21, skipping insertion in model container [2022-12-12 01:24:21,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:24:21" (2/3) ... [2022-12-12 01:24:21,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8f9197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:24:21, skipping insertion in model container [2022-12-12 01:24:21,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:24:21" (3/3) ... [2022-12-12 01:24:21,902 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-12-12 01:24:21,914 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 01:24:21,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 01:24:21,914 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 01:24:21,982 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-12 01:24:22,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 132 transitions, 288 flow [2022-12-12 01:24:22,063 INFO L130 PetriNetUnfolder]: 10/129 cut-off events. [2022-12-12 01:24:22,063 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 01:24:22,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 10/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2022-12-12 01:24:22,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 132 transitions, 288 flow [2022-12-12 01:24:22,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 119 transitions, 256 flow [2022-12-12 01:24:22,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 01:24:22,083 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14a01955, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 01:24:22,083 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-12 01:24:22,114 INFO L130 PetriNetUnfolder]: 10/118 cut-off events. [2022-12-12 01:24:22,115 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-12 01:24:22,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:24:22,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:24:22,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:24:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:24:22,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1220330430, now seen corresponding path program 1 times [2022-12-12 01:24:22,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:24:22,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129140152] [2022-12-12 01:24:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:24:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:24:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129140152] [2022-12-12 01:24:22,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129140152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:24:22,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:24:22,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 01:24:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470844225] [2022-12-12 01:24:22,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:24:22,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 01:24:22,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:24:22,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 01:24:22,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 01:24:22,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 132 [2022-12-12 01:24:22,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:22,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:24:22,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 132 [2022-12-12 01:24:22,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:24:23,023 INFO L130 PetriNetUnfolder]: 156/571 cut-off events. [2022-12-12 01:24:23,023 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-12-12 01:24:23,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 571 events. 156/571 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3005 event pairs, 23 based on Foata normal form. 56/561 useless extension candidates. Maximal degree in co-relation 777. Up to 79 conditions per place. [2022-12-12 01:24:23,032 INFO L137 encePairwiseOnDemand]: 119/132 looper letters, 41 selfloop transitions, 9 changer transitions 6/148 dead transitions. [2022-12-12 01:24:23,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 148 transitions, 449 flow [2022-12-12 01:24:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 01:24:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 01:24:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 922 transitions. [2022-12-12 01:24:23,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8731060606060606 [2022-12-12 01:24:23,049 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 7 predicate places. [2022-12-12 01:24:23,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 148 transitions, 449 flow [2022-12-12 01:24:23,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 142 transitions, 423 flow [2022-12-12 01:24:23,055 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 142 transitions, 423 flow [2022-12-12 01:24:23,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:23,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:24:23,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:24:23,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 01:24:23,060 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:24:23,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:24:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash 328701303, now seen corresponding path program 1 times [2022-12-12 01:24:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:24:23,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896243178] [2022-12-12 01:24:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:24:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:23,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:24:23,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896243178] [2022-12-12 01:24:23,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896243178] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:24:23,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963439078] [2022-12-12 01:24:23,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:23,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:24:23,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:24:23,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:24:23,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 01:24:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:23,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 01:24:23,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:24:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:23,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:24:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:23,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963439078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:24:23,487 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:24:23,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-12 01:24:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489270220] [2022-12-12 01:24:23,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:24:23,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 01:24:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:24:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 01:24:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-12 01:24:23,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2022-12-12 01:24:23,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 142 transitions, 423 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:23,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:24:23,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2022-12-12 01:24:23,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:24:23,616 INFO L130 PetriNetUnfolder]: 184/616 cut-off events. [2022-12-12 01:24:23,617 INFO L131 PetriNetUnfolder]: For 247/437 co-relation queries the response was YES. [2022-12-12 01:24:23,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 616 events. 184/616 cut-off events. For 247/437 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3237 event pairs, 24 based on Foata normal form. 21/564 useless extension candidates. Maximal degree in co-relation 1107. Up to 115 conditions per place. [2022-12-12 01:24:23,622 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 55 selfloop transitions, 8 changer transitions 9/168 dead transitions. [2022-12-12 01:24:23,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 668 flow [2022-12-12 01:24:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 01:24:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 01:24:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 795 transitions. [2022-12-12 01:24:23,624 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8603896103896104 [2022-12-12 01:24:23,624 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2022-12-12 01:24:23,624 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 168 transitions, 668 flow [2022-12-12 01:24:23,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 159 transitions, 614 flow [2022-12-12 01:24:23,628 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 159 transitions, 614 flow [2022-12-12 01:24:23,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:23,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:24:23,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:24:23,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 01:24:23,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:24:23,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:24:23,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:24:23,835 INFO L85 PathProgramCache]: Analyzing trace with hash 256679889, now seen corresponding path program 2 times [2022-12-12 01:24:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:24:23,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16621194] [2022-12-12 01:24:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:23,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:24:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:24,015 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-12 01:24:24,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:24:24,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16621194] [2022-12-12 01:24:24,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16621194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:24:24,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:24:24,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 01:24:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346553318] [2022-12-12 01:24:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:24:24,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 01:24:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:24:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 01:24:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 01:24:24,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 132 [2022-12-12 01:24:24,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 159 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:24,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:24:24,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 132 [2022-12-12 01:24:24,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:24:24,100 INFO L130 PetriNetUnfolder]: 182/610 cut-off events. [2022-12-12 01:24:24,100 INFO L131 PetriNetUnfolder]: For 694/878 co-relation queries the response was YES. [2022-12-12 01:24:24,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 610 events. 182/610 cut-off events. For 694/878 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2949 event pairs, 13 based on Foata normal form. 9/527 useless extension candidates. Maximal degree in co-relation 1303. Up to 161 conditions per place. [2022-12-12 01:24:24,103 INFO L137 encePairwiseOnDemand]: 126/132 looper letters, 39 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2022-12-12 01:24:24,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 157 transitions, 690 flow [2022-12-12 01:24:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 01:24:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 01:24:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2022-12-12 01:24:24,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8737373737373737 [2022-12-12 01:24:24,105 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2022-12-12 01:24:24,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 157 transitions, 690 flow [2022-12-12 01:24:24,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 157 transitions, 690 flow [2022-12-12 01:24:24,109 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 157 transitions, 690 flow [2022-12-12 01:24:24,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:24,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:24:24,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:24:24,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 01:24:24,109 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:24:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:24:24,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1543785749, now seen corresponding path program 1 times [2022-12-12 01:24:24,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:24:24,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156408644] [2022-12-12 01:24:24,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:24:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:24,310 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-12 01:24:24,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:24:24,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156408644] [2022-12-12 01:24:24,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156408644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:24:24,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:24:24,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 01:24:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314220234] [2022-12-12 01:24:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:24:24,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 01:24:24,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:24:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 01:24:24,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-12 01:24:24,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 132 [2022-12-12 01:24:24,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 157 transitions, 690 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:24,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:24:24,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 132 [2022-12-12 01:24:24,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:24:24,556 INFO L130 PetriNetUnfolder]: 308/873 cut-off events. [2022-12-12 01:24:24,557 INFO L131 PetriNetUnfolder]: For 2554/2949 co-relation queries the response was YES. [2022-12-12 01:24:24,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2681 conditions, 873 events. 308/873 cut-off events. For 2554/2949 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4889 event pairs, 63 based on Foata normal form. 5/753 useless extension candidates. Maximal degree in co-relation 2201. Up to 379 conditions per place. [2022-12-12 01:24:24,564 INFO L137 encePairwiseOnDemand]: 122/132 looper letters, 57 selfloop transitions, 6 changer transitions 16/177 dead transitions. [2022-12-12 01:24:24,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 989 flow [2022-12-12 01:24:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 01:24:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 01:24:24,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 900 transitions. [2022-12-12 01:24:24,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7575757575757576 [2022-12-12 01:24:24,569 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 20 predicate places. [2022-12-12 01:24:24,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 177 transitions, 989 flow [2022-12-12 01:24:24,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 161 transitions, 824 flow [2022-12-12 01:24:24,573 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 161 transitions, 824 flow [2022-12-12 01:24:24,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:24,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:24:24,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:24:24,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 01:24:24,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:24:24,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:24:24,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1622800546, now seen corresponding path program 1 times [2022-12-12 01:24:24,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:24:24,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450827371] [2022-12-12 01:24:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:24,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:24:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:25,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:25,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:24:25,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450827371] [2022-12-12 01:24:25,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450827371] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:24:25,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544698069] [2022-12-12 01:24:25,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:25,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:24:25,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:24:25,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:24:25,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 01:24:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:25,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-12 01:24:25,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:24:26,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:24:26,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:24:26,462 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 19 treesize of output 10 [2022-12-12 01:24:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:26,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:24:26,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:24:26,680 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 40 treesize of output 28 [2022-12-12 01:24:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:27,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544698069] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:24:27,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:24:27,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 15] total 42 [2022-12-12 01:24:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807898832] [2022-12-12 01:24:27,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:24:27,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-12 01:24:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:24:27,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-12 01:24:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=1419, Unknown=0, NotChecked=0, Total=1722 [2022-12-12 01:24:27,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 132 [2022-12-12 01:24:27,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 161 transitions, 824 flow. Second operand has 42 states, 42 states have (on average 62.54761904761905) internal successors, (2627), 42 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:27,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:24:27,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 132 [2022-12-12 01:24:27,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:24:35,767 INFO L130 PetriNetUnfolder]: 7825/14206 cut-off events. [2022-12-12 01:24:35,767 INFO L131 PetriNetUnfolder]: For 22057/22087 co-relation queries the response was YES. [2022-12-12 01:24:35,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46842 conditions, 14206 events. 7825/14206 cut-off events. For 22057/22087 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 115121 event pairs, 320 based on Foata normal form. 142/13259 useless extension candidates. Maximal degree in co-relation 30120. Up to 4493 conditions per place. [2022-12-12 01:24:35,870 INFO L137 encePairwiseOnDemand]: 95/132 looper letters, 676 selfloop transitions, 273 changer transitions 350/1344 dead transitions. [2022-12-12 01:24:35,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1344 transitions, 9894 flow [2022-12-12 01:24:35,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2022-12-12 01:24:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2022-12-12 01:24:35,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 8997 transitions. [2022-12-12 01:24:35,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5124743677375256 [2022-12-12 01:24:35,888 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 149 predicate places. [2022-12-12 01:24:35,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 268 places, 1344 transitions, 9894 flow [2022-12-12 01:24:35,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 994 transitions, 6995 flow [2022-12-12 01:24:35,928 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 994 transitions, 6995 flow [2022-12-12 01:24:35,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 62.54761904761905) internal successors, (2627), 42 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:35,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:24:35,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:24:35,936 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-12 01:24:36,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:24:36,136 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:24:36,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:24:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash 567692238, now seen corresponding path program 2 times [2022-12-12 01:24:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:24:36,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690488438] [2022-12-12 01:24:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:24:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:24:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:24:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:24:37,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690488438] [2022-12-12 01:24:37,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690488438] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:24:37,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870991350] [2022-12-12 01:24:37,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 01:24:37,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:24:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:24:37,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:24:37,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 01:24:37,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 01:24:37,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:24:37,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 01:24:37,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:24:38,042 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 15 treesize of output 11 [2022-12-12 01:24:38,369 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-12 01:24:38,457 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-12 01:24:38,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 01:24:38,671 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-12 01:24:38,744 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-12 01:24:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:24:38,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:24:38,972 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (< c_~front~0 0)) is different from false [2022-12-12 01:24:39,040 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-12-12 01:24:39,372 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse1) c_~sum~0) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse1) c_~sum~0))) (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 01:24:40,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:24:40,233 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 65 treesize of output 53 [2022-12-12 01:24:40,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:24:40,243 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 824 treesize of output 788 [2022-12-12 01:24:40,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:24:40,259 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 776 treesize of output 716 [2022-12-12 01:24:40,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:24:40,270 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 704 treesize of output 680 [2022-12-12 01:24:40,282 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 566 treesize of output 470 [2022-12-12 01:24:40,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:24:40,562 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 1 case distinctions, treesize of input 65 treesize of output 53 [2022-12-12 01:24:40,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:24:40,570 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:24:40,570 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 1 case distinctions, treesize of input 316 treesize of output 288 [2022-12-12 01:24:40,579 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:24:40,579 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 284 treesize of output 240 [2022-12-12 01:24:40,590 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:24:40,591 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 182 treesize of output 162 [2022-12-12 01:24:40,617 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 01:24:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 01:24:41,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870991350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:24:41,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:24:41,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 25] total 68 [2022-12-12 01:24:41,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668843020] [2022-12-12 01:24:41,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:24:41,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-12 01:24:41,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:24:41,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-12 01:24:41,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=3807, Unknown=19, NotChecked=384, Total=4556 [2022-12-12 01:24:41,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 132 [2022-12-12 01:24:41,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 994 transitions, 6995 flow. Second operand has 68 states, 68 states have (on average 48.661764705882355) internal successors, (3309), 68 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:24:41,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:24:41,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 132 [2022-12-12 01:24:41,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:24:48,372 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~front~0 c_~n~0)) (.cse0 (<= (+ c_~front~0 1) 0)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or (<= c_~front~0 c_~back~0) .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~v_assert~0 1) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (<= c_~back~0 c_~front~0) (not .cse0)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (<= .cse2 (+ c_~back~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) .cse0) (<= c_~n~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 1 c_~v_assert~0) (= c_~back~0 c_~front~0) (or (<= .cse2 (+ |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~back~0)) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~sum~0 0) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-12-12 01:24:50,058 WARN L837 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:25:01,572 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse25 (<= c_~sum~0 0)) (.cse26 (<= 0 (+ c_~sum~0 1))) (.cse27 (= .cse13 .cse12))) (let ((.cse2 (and .cse25 .cse26 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse27)) (.cse20 (and .cse25 .cse26 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse27)) (.cse6 (+ c_~queue~0.offset .cse13)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~queue~0.offset .cse12)) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (let ((.cse4 (+ c_~sum~0 (select .cse5 .cse6)))) (and (<= .cse4 1) (<= 0 .cse4))) .cse3) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= c_~n~0 1) (<= .cse7 0)) (<= c_~v_assert~0 1) (or .cse1 (let ((.cse9 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse10 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse9)) 1)) (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse10) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse9)))) (not (= (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse10) 1))))))) .cse3) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse1 (let ((.cse15 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse16))))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse16)) 1))))))) .cse3) (or .cse1 (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)) 1)) (not (= (select (select .cse18 c_~queue~0.base) .cse7) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)))) (not (= (select (select .cse19 c_~queue~0.base) .cse7) 1)))))) .cse3) (or (and (or (<= .cse6 0) (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (<= c_~back~0 c_~front~0) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~sum~0 0)) (not (= .cse7 0))) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (or .cse20 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse3) (<= c_~sum~0 1) (or (let ((.cse22 (+ .cse13 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse23 (+ .cse12 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse22)))) (not (= (select (select .cse21 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse23) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse22)) 1)) (not (= (select (select .cse24 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse23) 1))))))) .cse1 .cse3) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) .cse2 .cse3) (or .cse20 .cse0 .cse1 .cse3) (or .cse1 (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse3 (not (= (select .cse5 .cse7) 1))) (or .cse0 (and .cse25 .cse26 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse27) .cse1 .cse3))))) is different from false [2022-12-12 01:25:03,878 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse28 (<= c_~sum~0 0)) (.cse29 (<= 0 (+ c_~sum~0 1))) (.cse30 (= .cse16 .cse8)) (.cse6 (+ c_~queue~0.offset .cse16))) (let ((.cse7 (<= .cse6 0)) (.cse9 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse10 (= c_~sum~0 0)) (.cse2 (and .cse28 .cse29 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse30)) (.cse23 (and .cse28 .cse29 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse30)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse11 (+ c_~queue~0.offset .cse8)) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (let ((.cse4 (+ c_~sum~0 (select .cse5 .cse6)))) (and (<= .cse4 1) (<= 0 .cse4))) .cse3) (or (and .cse7 (not (<= (+ c_~queue~0.offset .cse8 1) 0)) (<= c_~back~0 0) (< 0 (+ c_~front~0 1)) .cse9 .cse10) (and (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= c_~n~0 1) (<= .cse11 0)) (<= c_~v_assert~0 1) (or .cse1 (let ((.cse13 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse14 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse13)) 1)) (not (= (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse14) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse13)))) (not (= (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse14) 1))))))) .cse3) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse1 (let ((.cse18 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse19 (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19))))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse19)) 1))))))) .cse3) (or .cse1 (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)) 1)) (not (= (select (select .cse21 c_~queue~0.base) .cse11) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)))) (not (= (select (select .cse22 c_~queue~0.base) .cse11) 1)))))) .cse3) (or (and (or .cse7 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (<= c_~back~0 c_~front~0) .cse9 .cse10) (not (= .cse11 0))) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (or .cse23 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse3) (<= c_~sum~0 1) (or (let ((.cse25 (+ .cse16 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse26 (+ .cse8 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse25)))) (not (= (select (select .cse24 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse26) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse25)) 1)) (not (= (select (select .cse27 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse26) 1))))))) .cse1 .cse3) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) .cse2 .cse3) (or .cse23 .cse0 .cse1 .cse3) (or .cse1 (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse3 (not (= (select .cse5 .cse11) 1))) (or .cse0 (and .cse28 .cse29 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse30) .cse1 .cse3))))) is different from false [2022-12-12 01:25:06,078 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~front~0 4))) (let ((.cse14 (* c_~back~0 4)) (.cse6 (+ c_~queue~0.offset .cse15))) (let ((.cse22 (<= .cse6 0)) (.cse23 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse24 (= c_~sum~0 0)) (.cse30 (<= c_~sum~0 0)) (.cse31 (<= 0 (+ c_~sum~0 1))) (.cse32 (= .cse15 .cse14))) (let ((.cse2 (and .cse30 .cse31 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse32)) (.cse25 (and .cse30 .cse31 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse32)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (+ c_~queue~0.offset .cse14)) (.cse7 (and .cse22 (not (<= (+ c_~queue~0.offset .cse14 1) 0)) (<= c_~back~0 0) (< 0 (+ c_~front~0 1)) .cse23 .cse24)) (.cse8 (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0)))) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse0 .cse1 .cse2 .cse3) (or .cse1 (let ((.cse4 (+ c_~sum~0 (select .cse5 .cse6)))) (and (<= .cse4 1) (<= 0 .cse4))) .cse3) (or .cse7 (and .cse8 (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= c_~n~0 1) (<= .cse9 0)) (<= c_~v_assert~0 1) (or .cse1 (let ((.cse11 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse11)) 1)) (not (= (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse12) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse11)))) (not (= (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse12) 1))))))) .cse3) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse1 (let ((.cse17 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (+ .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18))))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse18)) 1))))))) .cse3) (or .cse1 (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)) 1)) (not (= (select (select .cse20 c_~queue~0.base) .cse9) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)))) (not (= (select (select .cse21 c_~queue~0.base) .cse9) 1)))))) .cse3) (or (and (or .cse22 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (<= c_~back~0 c_~front~0) .cse23 .cse24) (not (= .cse9 0))) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (or .cse25 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse3) (<= c_~sum~0 1) (or (let ((.cse27 (+ .cse15 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse28 (+ .cse14 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse27)))) (not (= (select (select .cse26 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse28) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse27)) 1)) (not (= (select (select .cse29 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse28) 1))))))) .cse1 .cse3) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) .cse2 .cse3) (or .cse25 .cse0 .cse1 .cse3) (or .cse1 (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse6))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse3 (not (= (select .cse5 .cse9) 1))) (or .cse7 (and .cse8 (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0))) (or .cse0 (and .cse30 .cse31 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse32) .cse1 .cse3)))))) is different from false [2022-12-12 01:25:14,492 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4)) (.cse2 (< c_~front~0 0)) (.cse1 (* c_~back~0 4))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse0 .cse1)) .cse2) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset .cse0))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1))))) is different from false [2022-12-12 01:25:18,962 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:25:18,965 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:25:19,128 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:25:20,364 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:25:20,467 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:25:20,914 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:25:27,524 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4)) (.cse2 (< c_~front~0 0)) (.cse1 (* c_~back~0 4))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse0 .cse1)) .cse2) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset .cse0))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1))))) is different from false [2022-12-12 01:26:17,856 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:26:27,541 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= c_~sum~0 0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:26:27,548 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= c_~sum~0 0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:26:27,803 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4)) (.cse2 (< c_~front~0 0)) (.cse1 (* c_~back~0 4))) (and (<= 1 c_~sum~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= c_~sum~0 1) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse0 .cse1)) .cse2) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset .cse0))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1))))) is different from false [2022-12-12 01:26:41,639 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4)) (.cse2 (< c_~front~0 0)) (.cse1 (* c_~back~0 4))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse0 .cse1)) .cse2) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset .cse0))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1))))) is different from false [2022-12-12 01:26:48,970 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4)) (.cse2 (< c_~front~0 0)) (.cse1 (* c_~back~0 4))) (and (<= 1 c_~sum~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= c_~sum~0 1) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse0 .cse1)) .cse2) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset .cse0))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1))))) is different from false [2022-12-12 01:26:50,492 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) is different from false [2022-12-12 01:26:50,988 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4)) (.cse2 (< c_~front~0 0)) (.cse1 (* c_~back~0 4))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse0 .cse1)) .cse2) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset .cse0))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1))))) is different from false [2022-12-12 01:26:57,687 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~front~0 4)) (.cse2 (< c_~front~0 0)) (.cse1 (* c_~back~0 4))) (and (<= 1 c_~sum~0) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse0 .cse1)) .cse2) (or (<= c_~n~0 c_~front~0) (let ((.cse3 (+ c_~queue~0.offset .cse0))) (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse3)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse1)) 1))))) is different from false [2022-12-12 01:26:58,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~front~0 4)) (.cse8 (* c_~back~0 4))) (let ((.cse5 (<= c_~sum~0 0)) (.cse9 (<= 0 (+ c_~sum~0 1))) (.cse19 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|))) (.cse25 (= .cse14 .cse8))) (let ((.cse0 (+ c_~queue~0.offset .cse14)) (.cse7 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (and .cse5 .cse9 .cse19 .cse25)) (.cse20 (and .cse5 .cse9 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse25)) (.cse1 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (<= c_~n~0 c_~front~0)) (.cse4 (< c_~front~0 0))) (and (<= .cse0 0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse1 .cse2 .cse3 .cse4) .cse5 (or .cse2 (let ((.cse6 (+ c_~sum~0 (select .cse7 .cse0)))) (and (<= .cse6 1) (<= 0 .cse6))) .cse4) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (not (<= (+ c_~queue~0.offset .cse8 1) 0)) .cse9 (or .cse2 (let ((.cse11 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse12 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse11)) 1)) (not (= (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse12) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse11)))) (not (= (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse12) 1))))))) .cse4) (or .cse2 (and (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) c_~queue~0.base) .cse0))))) .cse4 (not (= (select .cse7 (+ c_~queue~0.offset .cse8)) 1))) (or .cse2 .cse3 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse4) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse2 (let ((.cse16 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse16) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17))))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (not (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse16) 1)) (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17)) 1))))))) .cse4) .cse19 (<= 1 c_~v_assert~0) (or .cse20 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2 .cse4) (<= c_~back~0 0) (or (let ((.cse22 (+ .cse14 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse23 (+ .cse8 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse22)))) (not (= (select (select .cse21 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse23) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_138))) (or (forall ((v_ArrVal_139 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_139) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse22)) 1)) (not (= (select (select .cse24 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse23) 1))))))) .cse2 .cse4) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (< 0 c_~front~0) .cse3 .cse4) (< 0 (+ c_~front~0 1)) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~sum~0 0) (or .cse20 .cse1 .cse2 .cse4) (or .cse1 (and .cse5 .cse9 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse25) .cse2 .cse4))))) is different from false [2022-12-12 01:27:41,693 INFO L130 PetriNetUnfolder]: 35557/64942 cut-off events. [2022-12-12 01:27:41,693 INFO L131 PetriNetUnfolder]: For 117549/118195 co-relation queries the response was YES. [2022-12-12 01:27:41,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278103 conditions, 64942 events. 35557/64942 cut-off events. For 117549/118195 co-relation queries the response was YES. Maximal size of possible extension queue 2383. Compared 644279 event pairs, 433 based on Foata normal form. 1806/64316 useless extension candidates. Maximal degree in co-relation 235117. Up to 20593 conditions per place. [2022-12-12 01:27:42,183 INFO L137 encePairwiseOnDemand]: 80/132 looper letters, 6490 selfloop transitions, 2805 changer transitions 527/9860 dead transitions. [2022-12-12 01:27:42,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 9860 transitions, 91036 flow [2022-12-12 01:27:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 388 states. [2022-12-12 01:27:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2022-12-12 01:27:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 21147 transitions. [2022-12-12 01:27:42,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.412898313027179 [2022-12-12 01:27:42,278 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 531 predicate places. [2022-12-12 01:27:42,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 650 places, 9860 transitions, 91036 flow [2022-12-12 01:27:42,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 610 places, 9333 transitions, 86363 flow [2022-12-12 01:27:42,578 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 9333 transitions, 86363 flow [2022-12-12 01:27:42,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 48.661764705882355) internal successors, (3309), 68 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:27:42,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:27:42,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:27:42,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 01:27:42,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:27:42,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:27:42,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:27:42,785 INFO L85 PathProgramCache]: Analyzing trace with hash 973127786, now seen corresponding path program 3 times [2022-12-12 01:27:42,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:27:42,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642067332] [2022-12-12 01:27:42,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:27:42,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:27:42,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:27:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:27:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:27:43,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642067332] [2022-12-12 01:27:43,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642067332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:27:43,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681921938] [2022-12-12 01:27:43,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 01:27:43,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:27:43,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:27:43,825 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:27:43,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 01:27:43,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 01:27:43,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:27:43,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 01:27:43,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:27:44,383 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 15 treesize of output 11 [2022-12-12 01:27:44,750 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-12 01:27:44,840 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-12 01:27:45,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 01:27:45,077 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-12 01:27:45,150 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-12 01:27:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:27:45,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:27:45,414 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse0)))))) (< c_~front~0 0)) is different from false [2022-12-12 01:27:45,482 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse0)))))) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-12-12 01:27:45,496 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-12-12 01:27:45,666 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse1))))))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2022-12-12 01:27:46,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:27:46,598 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 65 treesize of output 53 [2022-12-12 01:27:46,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:27:46,606 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 232 treesize of output 228 [2022-12-12 01:27:46,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:27:46,614 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 216 treesize of output 204 [2022-12-12 01:27:46,619 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 140 treesize of output 116 [2022-12-12 01:27:46,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:27:46,628 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 113 treesize of output 113 [2022-12-12 01:27:46,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:27:46,943 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 65 treesize of output 53 [2022-12-12 01:27:46,948 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:27:46,955 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:27:46,956 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 316 treesize of output 288 [2022-12-12 01:27:46,966 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:27:46,966 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 284 treesize of output 264 [2022-12-12 01:27:46,977 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:27:46,978 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 260 treesize of output 216 [2022-12-12 01:27:47,008 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 01:27:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 01:27:47,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681921938] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:27:47,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:27:47,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 25] total 68 [2022-12-12 01:27:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467617551] [2022-12-12 01:27:47,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:27:47,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-12 01:27:47,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:27:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-12 01:27:47,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=3696, Unknown=18, NotChecked=508, Total=4556 [2022-12-12 01:27:47,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 132 [2022-12-12 01:27:47,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 9333 transitions, 86363 flow. Second operand has 68 states, 68 states have (on average 50.470588235294116) internal successors, (3432), 68 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:27:47,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:27:47,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 132 [2022-12-12 01:27:47,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:28:00,911 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse25 (<= c_~sum~0 0)) (.cse26 (<= 0 (+ c_~sum~0 1))) (.cse27 (= .cse9 .cse10))) (let ((.cse2 (and .cse25 .cse26 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse27)) (.cse16 (and .cse25 .cse26 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse27)) (.cse4 (+ c_~queue~0.offset .cse9)) (.cse18 (+ c_~queue~0.offset .cse10)) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or .cse0 .cse1 .cse2 .cse3) (or (<= .cse4 0) (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (or .cse1 (let ((.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6)))) (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7) 1))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6)) 1))))))) .cse3) (or .cse1 (let ((.cse11 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse4)))) (and (<= .cse11 1) (<= 0 .cse11))) .cse3) (<= c_~v_assert~0 1) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse1 (let ((.cse13 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14))))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse13) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14)) 1))))))) .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (or .cse16 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse3) (or (not (= .cse4 0)) (let ((.cse17 (= .cse18 0))) (and (or (and (not (<= (+ c_~queue~0.offset .cse10 1) 0)) (<= c_~n~0 1)) .cse17) (or (and (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~sum~0 0)) (not .cse17))))) (<= c_~sum~0 1) (or (< 0 c_~front~0) .cse2 .cse3) (or (let ((.cse21 (+ .cse9 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse20 (+ .cse10 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse19 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse20) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse21))))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse21)) 1)) (not (= (select (select .cse22 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse20) 1))))))) .cse1 .cse3) (or .cse16 .cse0 .cse1 .cse3) (or .cse1 .cse3 (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse4)))) (not (= (select (select .cse23 c_~queue~0.base) .cse18) 1))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse4)) 1)) (not (= (select (select .cse24 c_~queue~0.base) .cse18) 1))))))) (or .cse0 (and .cse25 .cse26 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse27) .cse1 .cse3))))) is different from false [2022-12-12 01:28:02,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse30 (<= c_~sum~0 0)) (.cse31 (<= 0 (+ c_~sum~0 1))) (.cse32 (= .cse9 .cse10)) (.cse28 (+ c_~queue~0.offset .cse10)) (.cse12 (+ c_~queue~0.offset .cse9))) (let ((.cse4 (<= .cse12 0)) (.cse21 (= c_~queue~0.offset 0)) (.cse17 (not (= .cse12 0))) (.cse19 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse20 (= c_~sum~0 0)) (.cse18 (= .cse28 0)) (.cse2 (and .cse30 .cse31 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse32)) (.cse22 (and .cse30 .cse31 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse32)) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (or .cse1 (let ((.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6)))) (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7) 1))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6)) 1))))))) .cse3) (or .cse1 (let ((.cse11 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse12)))) (and (<= .cse11 1) (<= 0 .cse11))) .cse3) (<= c_~v_assert~0 1) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse1 (let ((.cse14 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse15 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15))))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15)) 1))))))) .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (and .cse4 (or .cse17 (and .cse18 .cse19 .cse20)) .cse21) (and (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0))) (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) .cse21 (<= 1 c_~v_assert~0) (or .cse22 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse3) (or .cse17 (and (or (and (not (<= (+ c_~queue~0.offset .cse10 1) 0)) (<= c_~n~0 1)) .cse18) (or (and .cse19 .cse20) (not .cse18)))) (<= c_~sum~0 1) (or (< 0 c_~front~0) .cse2 .cse3) (or (let ((.cse25 (+ .cse9 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse24 (+ .cse10 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse23 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse24) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse25))))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse25)) 1)) (not (= (select (select .cse26 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse24) 1))))))) .cse1 .cse3) (or .cse22 .cse0 .cse1 .cse3) (or .cse1 .cse3 (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse12)))) (not (= (select (select .cse27 c_~queue~0.base) .cse28) 1))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse12)) 1)) (not (= (select (select .cse29 c_~queue~0.base) .cse28) 1))))))) (or .cse0 (and .cse30 .cse31 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse32) .cse1 .cse3))))) is different from false [2022-12-12 01:28:04,003 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse30 (+ c_~queue~0.offset .cse10)) (.cse12 (+ c_~queue~0.offset .cse9))) (let ((.cse32 (<= c_~sum~0 0)) (.cse33 (<= 0 (+ c_~sum~0 1))) (.cse34 (= .cse9 .cse10)) (.cse4 (<= .cse12 0)) (.cse21 (not (= .cse12 0))) (.cse22 (= .cse30 0)) (.cse23 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse24 (= c_~sum~0 0)) (.cse19 (= c_~queue~0.offset 0))) (let ((.cse13 (and .cse4 (or .cse21 (and .cse22 .cse23 .cse24)) .cse19)) (.cse14 (or (<= c_~n~0 c_~back~0) (not (<= 0 c_~back~0)))) (.cse2 (and .cse32 .cse33 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse34)) (.cse20 (and .cse32 .cse33 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse34)) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse3 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 1))) (or .cse1 (let ((.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6)))) (not (= (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7) 1))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse7) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse6)) 1))))))) .cse3) (or .cse1 (let ((.cse11 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse12)))) (and (<= .cse11 1) (<= 0 .cse11))) .cse3) (<= c_~v_assert~0 1) (or .cse13 (and .cse14 (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| 0))) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or .cse1 (let ((.cse16 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse17 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse16) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17))))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse16) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse17)) 1))))))) .cse3) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse13 (and .cse14 (= |c_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| 0))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) .cse19 (<= 1 c_~v_assert~0) (or .cse20 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse3) (or .cse21 (and (or (and (not (<= (+ c_~queue~0.offset .cse10 1) 0)) (<= c_~n~0 1)) .cse22) (or (and .cse23 .cse24) (not .cse22)))) (<= c_~sum~0 1) (or (< 0 c_~front~0) .cse2 .cse3) (or (let ((.cse27 (+ .cse9 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse26 (+ .cse10 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (not (= (select (select .cse25 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse26) 1)) (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse27))))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse28 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse27)) 1)) (not (= (select (select .cse28 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse26) 1))))))) .cse1 .cse3) (or .cse20 .cse0 .cse1 .cse3) (or .cse1 .cse3 (and (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse12)))) (not (= (select (select .cse29 c_~queue~0.base) .cse30) 1))))) (forall ((v_ArrVal_175 (Array Int Int)) (v_ArrVal_174 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_175))) (or (forall ((v_ArrVal_176 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_176) c_~queue~0.base) .cse12)) 1)) (not (= (select (select .cse31 c_~queue~0.base) .cse30) 1))))))) (or .cse0 (and .cse32 .cse33 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse34) .cse1 .cse3)))))) is different from false [2022-12-12 01:29:19,136 INFO L130 PetriNetUnfolder]: 71646/131469 cut-off events. [2022-12-12 01:29:19,136 INFO L131 PetriNetUnfolder]: For 251860/253365 co-relation queries the response was YES. [2022-12-12 01:29:19,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675566 conditions, 131469 events. 71646/131469 cut-off events. For 251860/253365 co-relation queries the response was YES. Maximal size of possible extension queue 5025. Compared 1447843 event pairs, 533 based on Foata normal form. 1636/128142 useless extension candidates. Maximal degree in co-relation 466508. Up to 41547 conditions per place. [2022-12-12 01:29:19,969 INFO L137 encePairwiseOnDemand]: 86/132 looper letters, 15294 selfloop transitions, 4249 changer transitions 6089/26035 dead transitions. [2022-12-12 01:29:19,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 740 places, 26035 transitions, 290930 flow [2022-12-12 01:29:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-12-12 01:29:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2022-12-12 01:29:19,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 7429 transitions. [2022-12-12 01:29:19,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4296206338191071 [2022-12-12 01:29:19,976 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 621 predicate places. [2022-12-12 01:29:19,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 740 places, 26035 transitions, 290930 flow [2022-12-12 01:29:20,933 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 721 places, 19946 transitions, 224940 flow [2022-12-12 01:29:20,933 INFO L495 AbstractCegarLoop]: Abstraction has has 721 places, 19946 transitions, 224940 flow [2022-12-12 01:29:20,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 50.470588235294116) internal successors, (3432), 68 states have internal predecessors, (3432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:29:20,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:29:20,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:29:20,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-12 01:29:21,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:29:21,141 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:29:21,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:29:21,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1630129130, now seen corresponding path program 4 times [2022-12-12 01:29:21,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:29:21,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533073201] [2022-12-12 01:29:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:29:21,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:29:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:29:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:29:21,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:29:21,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533073201] [2022-12-12 01:29:21,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533073201] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:29:21,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305612545] [2022-12-12 01:29:21,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 01:29:21,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:29:21,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:29:21,815 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:29:21,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 01:29:21,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 01:29:21,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:29:21,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-12 01:29:21,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:29:22,575 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 15 treesize of output 11 [2022-12-12 01:29:22,949 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-12 01:29:23,034 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-12 01:29:23,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 01:29:23,235 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-12 01:29:23,287 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-12 01:29:23,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:29:23,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:29:23,605 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (< c_~front~0 0)) is different from false [2022-12-12 01:29:23,627 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) is different from false [2022-12-12 01:29:23,928 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_212 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_212 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse1)))) (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1))))))) (< c_~front~0 0)) is different from false [2022-12-12 01:29:25,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:29:25,048 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 65 treesize of output 53 [2022-12-12 01:29:25,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:29:25,057 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 232 treesize of output 228 [2022-12-12 01:29:25,062 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 152 treesize of output 128 [2022-12-12 01:29:25,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:29:25,076 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 192 treesize of output 180 [2022-12-12 01:29:25,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:29:25,088 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 113 treesize of output 113 [2022-12-12 01:29:25,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:29:25,350 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 1 case distinctions, treesize of input 65 treesize of output 53 [2022-12-12 01:29:25,354 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:29:25,362 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:29:25,362 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 1 case distinctions, treesize of input 316 treesize of output 288 [2022-12-12 01:29:25,373 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:29:25,374 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 284 treesize of output 240 [2022-12-12 01:29:25,384 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 01:29:25,385 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 236 treesize of output 216 [2022-12-12 01:29:25,422 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 01:29:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-12 01:29:26,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305612545] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:29:26,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:29:26,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 25] total 59 [2022-12-12 01:29:26,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802011273] [2022-12-12 01:29:26,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:29:26,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-12-12 01:29:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:29:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-12-12 01:29:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2747, Unknown=21, NotChecked=330, Total=3422 [2022-12-12 01:29:26,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 132 [2022-12-12 01:29:26,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 19946 transitions, 224940 flow. Second operand has 59 states, 59 states have (on average 52.88135593220339) internal successors, (3120), 59 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:29:26,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:29:26,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 132 [2022-12-12 01:29:26,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:29:31,754 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4)) (.cse5 (* c_~back~0 4))) (let ((.cse14 (<= c_~sum~0 0)) (.cse15 (<= 0 (+ c_~sum~0 1))) (.cse16 (= .cse4 .cse5))) (let ((.cse9 (select |c_#memory_int| c_~queue~0.base)) (.cse10 (+ c_~queue~0.offset .cse4)) (.cse11 (+ c_~queue~0.offset .cse5)) (.cse18 (and .cse14 .cse15 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t3~0#1.base| 1)) .cse16)) (.cse23 (and .cse14 .cse15 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse16)) (.cse17 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse6 (<= c_~n~0 c_~front~0)) (.cse7 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (or (let ((.cse1 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2)) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (not (= (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse2))))))))) .cse6 .cse7) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or .cse6 (let ((.cse8 (+ c_~sum~0 (select .cse9 .cse10)))) (and (<= .cse8 1) (<= 0 .cse8))) .cse7) (or .cse6 (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse10)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse10)) 1))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse7 (not (= (select .cse9 .cse11) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or .cse6 (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (not (= (select (select .cse12 c_~queue~0.base) .cse11) 1)) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse10)) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse10)))) (not (= (select (select .cse13 c_~queue~0.base) .cse11) 1)))))) .cse7) (or (and .cse14 .cse15 (not (<= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) .cse16) .cse17 .cse6 .cse7) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse17 .cse6 .cse18 .cse7) (or .cse6 .cse18 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse7) (or (let ((.cse20 (+ .cse5 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse21 (+ .cse4 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (not (= (select (select .cse19 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse20) 1)) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse21)) 1))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (not (= (select (select .cse22 |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse20) 1)) (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse22 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_#t~ret9#1.base|) .cse21))))))))) .cse6 .cse7) (<= 1 c_~v_assert~0) (or (< 0 c_~front~0) .cse18 .cse7) (or .cse23 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse7) (<= c_~sum~0 1) (or .cse6 (let ((.cse25 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse26 (+ .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (not (= (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse25) 1)) (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse26))))))) (forall ((v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (or (not (= (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse25) 1)) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse26)) 1))))))) .cse7) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or .cse23 .cse17 .cse6 .cse7))))) is different from false [2022-12-12 01:29:40,023 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|)) is different from false [2022-12-12 01:29:42,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t3~0#1.base| 1)) (= .cse1 .cse3)) .cse2) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-12-12 01:29:43,126 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= c_~sum~0 1)) is different from false [2022-12-12 01:29:43,307 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:43,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~front~0)) (.cse1 (let ((.cse3 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse3)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse3)) 1))))) (.cse2 (< c_~front~0 0))) (and (or .cse0 .cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (or .cse0 .cse1 .cse2))) is different from false [2022-12-12 01:29:43,361 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:44,309 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= c_~sum~0 1)) is different from false [2022-12-12 01:29:46,838 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= c_~sum~0 1)) is different from false [2022-12-12 01:29:47,530 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:47,805 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:47,985 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:49,987 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:50,332 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:50,850 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-12 01:29:58,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t3~0#1.base| 1)) (= .cse1 .cse3)) .cse2) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-12-12 01:29:58,662 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t3~0#1.base| 1)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-12 01:29:58,862 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse2 (< c_~front~0 0))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset .cse1))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) .cse2 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3)) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (or (< 0 c_~front~0) (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t3~0#1.base| 1)) (= .cse1 .cse3)) .cse2))) is different from false [2022-12-12 01:31:42,452 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_213 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_213 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0) (< c_~front~0 0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0)) is different from false [2022-12-12 01:36:04,953 INFO L130 PetriNetUnfolder]: 108532/195331 cut-off events. [2022-12-12 01:36:04,953 INFO L131 PetriNetUnfolder]: For 461292/465540 co-relation queries the response was YES. [2022-12-12 01:36:05,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184287 conditions, 195331 events. 108532/195331 cut-off events. For 461292/465540 co-relation queries the response was YES. Maximal size of possible extension queue 7497. Compared 2204030 event pairs, 734 based on Foata normal form. 2053/191265 useless extension candidates. Maximal degree in co-relation 648753. Up to 62616 conditions per place. [2022-12-12 01:36:06,686 INFO L137 encePairwiseOnDemand]: 86/132 looper letters, 24367 selfloop transitions, 10525 changer transitions 17/37543 dead transitions. [2022-12-12 01:36:06,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 837 places, 37543 transitions, 498309 flow [2022-12-12 01:36:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-12-12 01:36:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2022-12-12 01:36:06,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 6749 transitions. [2022-12-12 01:36:06,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.436998186998187 [2022-12-12 01:36:06,694 INFO L295 CegarLoopForPetriNet]: 119 programPoint places, 718 predicate places. [2022-12-12 01:36:06,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 837 places, 37543 transitions, 498309 flow [2022-12-12 01:36:08,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 837 places, 37526 transitions, 498099 flow [2022-12-12 01:36:08,273 INFO L495 AbstractCegarLoop]: Abstraction has has 837 places, 37526 transitions, 498099 flow [2022-12-12 01:36:08,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 52.88135593220339) internal successors, (3120), 59 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:36:08,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:36:08,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:36:08,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 01:36:08,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:36:08,479 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-12 01:36:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:36:08,479 INFO L85 PathProgramCache]: Analyzing trace with hash 298419730, now seen corresponding path program 5 times [2022-12-12 01:36:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:36:08,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524076638] [2022-12-12 01:36:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:36:08,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:36:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:36:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:36:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:36:10,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524076638] [2022-12-12 01:36:10,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524076638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:36:10,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158209514] [2022-12-12 01:36:10,011 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 01:36:10,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:36:10,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:36:10,012 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:36:10,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 01:36:10,150 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 01:36:10,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:36:10,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-12 01:36:10,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:36:10,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-12 01:36:10,411 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 01:36:10,411 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 11 treesize of output 11 [2022-12-12 01:36:11,470 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-12 01:36:11,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-12 01:36:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:36:11,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:36:11,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:36:11,937 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 82 treesize of output 70 [2022-12-12 01:36:11,941 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 53 treesize of output 47 [2022-12-12 01:36:11,945 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 47 treesize of output 41 [2022-12-12 01:36:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:36:14,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158209514] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:36:14,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:36:14,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 26] total 68 [2022-12-12 01:36:14,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652465065] [2022-12-12 01:36:14,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:36:14,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-12 01:36:14,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:36:14,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-12 01:36:14,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=4163, Unknown=6, NotChecked=0, Total=4556 [2022-12-12 01:36:14,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 132 [2022-12-12 01:36:14,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 837 places, 37526 transitions, 498099 flow. Second operand has 68 states, 68 states have (on average 53.38235294117647) internal successors, (3630), 68 states have internal predecessors, (3630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:36:14,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:36:14,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 132 [2022-12-12 01:36:14,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 01:37:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-12-12 01:37:56,831 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-12 01:37:56,835 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-12 01:37:56,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 01:37:56,841 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 01:37:57,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:37:57,033 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 51/132 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 109086 conditions, 15866 events (8331/15865 cut-off events. For 46099/47462 co-relation queries the response was YES. Maximal size of possible extension queue 3500. Compared 169616 event pairs, 200 based on Foata normal form. 180/19250 useless extension candidates. Maximal degree in co-relation 62833. Up to 5552 conditions per place.). [2022-12-12 01:37:57,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-12 01:37:57,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-12 01:37:57,034 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-12 01:37:57,034 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2022-12-12 01:37:57,037 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 01:37:57,037 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 01:37:57,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 01:37:57 BasicIcfg [2022-12-12 01:37:57,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 01:37:57,039 INFO L158 Benchmark]: Toolchain (without parser) took 815954.58ms. Allocated memory was 174.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 150.3MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 01:37:57,040 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 01:37:57,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.84ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 136.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-12 01:37:57,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.80ms. Allocated memory is still 174.1MB. Free memory was 136.6MB in the beginning and 134.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 01:37:57,040 INFO L158 Benchmark]: Boogie Preprocessor took 32.14ms. Allocated memory is still 174.1MB. Free memory was 134.5MB in the beginning and 133.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 01:37:57,040 INFO L158 Benchmark]: RCFGBuilder took 486.38ms. Allocated memory is still 174.1MB. Free memory was 133.0MB in the beginning and 111.5MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-12 01:37:57,040 INFO L158 Benchmark]: TraceAbstraction took 815157.44ms. Allocated memory was 174.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 109.9MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2022-12-12 01:37:57,041 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.84ms. Allocated memory is still 174.1MB. Free memory was 150.3MB in the beginning and 136.6MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.80ms. Allocated memory is still 174.1MB. Free memory was 136.6MB in the beginning and 134.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.14ms. Allocated memory is still 174.1MB. Free memory was 134.5MB in the beginning and 133.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 486.38ms. Allocated memory is still 174.1MB. Free memory was 133.0MB in the beginning and 111.5MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 815157.44ms. Allocated memory was 174.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 109.9MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 51/132 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 109086 conditions, 15866 events (8331/15865 cut-off events. For 46099/47462 co-relation queries the response was YES. Maximal size of possible extension queue 3500. Compared 169616 event pairs, 200 based on Foata normal form. 180/19250 useless extension candidates. Maximal degree in co-relation 62833. Up to 5552 conditions per place.). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 51/132 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 109086 conditions, 15866 events (8331/15865 cut-off events. For 46099/47462 co-relation queries the response was YES. Maximal size of possible extension queue 3500. Compared 169616 event pairs, 200 based on Foata normal form. 180/19250 useless extension candidates. Maximal degree in co-relation 62833. Up to 5552 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 51/132 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 109086 conditions, 15866 events (8331/15865 cut-off events. For 46099/47462 co-relation queries the response was YES. Maximal size of possible extension queue 3500. Compared 169616 event pairs, 200 based on Foata normal form. 180/19250 useless extension candidates. Maximal degree in co-relation 62833. Up to 5552 conditions per place.). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 51/132 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 109086 conditions, 15866 events (8331/15865 cut-off events. For 46099/47462 co-relation queries the response was YES. Maximal size of possible extension queue 3500. Compared 169616 event pairs, 200 based on Foata normal form. 180/19250 useless extension candidates. Maximal degree in co-relation 62833. Up to 5552 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 154 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 2.9s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 815.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 785.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 1021 mSolverCounterUnknown, 13788 SdHoareTripleChecker+Valid, 28.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13788 mSDsluCounter, 17697 SdHoareTripleChecker+Invalid, 25.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3992 IncrementalHoareTripleChecker+Unchecked, 17027 mSDsCounter, 957 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34701 IncrementalHoareTripleChecker+Invalid, 40671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 957 mSolverCounterUnsat, 670 mSDtfsCounter, 34701 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1021 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2261 GetRequests, 1066 SyntacticMatches, 76 SemanticMatches, 1119 ConstructedPredicates, 55 IntricatePredicates, 0 DeprecatedPredicates, 111451 ImplicationChecksByTransitivity, 201.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498099occurred in iteration=8, InterpolantAutomatonStates: 796, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 74017 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 1542 NumberOfCodeBlocks, 1542 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2152 ConstructedInterpolants, 139 QuantifiedInterpolants, 34530 SizeOfPredicates, 162 NumberOfNonLiveVariables, 1689 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 13/51 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown