/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 05:04:52,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 05:04:52,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 05:04:52,600 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 05:04:52,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 05:04:52,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 05:04:52,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 05:04:52,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 05:04:52,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 05:04:52,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 05:04:52,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 05:04:52,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 05:04:52,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 05:04:52,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 05:04:52,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 05:04:52,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 05:04:52,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 05:04:52,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 05:04:52,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 05:04:52,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 05:04:52,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 05:04:52,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 05:04:52,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 05:04:52,637 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 05:04:52,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 05:04:52,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 05:04:52,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 05:04:52,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 05:04:52,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 05:04:52,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 05:04:52,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 05:04:52,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 05:04:52,649 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 05:04:52,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 05:04:52,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 05:04:52,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 05:04:52,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 05:04:52,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 05:04:52,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 05:04:52,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 05:04:52,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 05:04:52,654 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 05:04:52,683 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 05:04:52,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 05:04:52,684 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 05:04:52,684 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 05:04:52,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 05:04:52,685 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 05:04:52,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 05:04:52,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 05:04:52,686 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 05:04:52,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 05:04:52,687 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 05:04:52,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 05:04:52,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 05:04:52,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 05:04:52,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 05:04:52,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 05:04:52,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 05:04:52,688 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 05:04:52,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 05:04:52,688 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 05:04:52,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 05:04:52,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 05:04:52,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 05:04:52,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 05:04:52,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 05:04:52,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 05:04:52,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 05:04:52,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 05:04:52,691 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 05:04:52,692 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: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 05:04:52,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 05:04:52,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 05:04:52,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 05:04:52,934 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 05:04:52,935 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 05:04:52,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-05-04 05:04:52,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4f0e5c7/cb4e04470b3b4d99a224a22e11d6f34b/FLAG5a6c6837e [2023-05-04 05:04:53,557 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 05:04:53,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2023-05-04 05:04:53,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4f0e5c7/cb4e04470b3b4d99a224a22e11d6f34b/FLAG5a6c6837e [2023-05-04 05:04:54,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4f0e5c7/cb4e04470b3b4d99a224a22e11d6f34b [2023-05-04 05:04:54,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 05:04:54,019 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 05:04:54,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 05:04:54,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 05:04:54,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 05:04:54,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:54,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2c6ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54, skipping insertion in model container [2023-05-04 05:04:54,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:54,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 05:04:54,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 05:04:54,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2023-05-04 05:04:54,711 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2023-05-04 05:04:54,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2023-05-04 05:04:54,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 05:04:54,751 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 05:04:54,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2023-05-04 05:04:54,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2023-05-04 05:04:54,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2023-05-04 05:04:54,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 05:04:54,927 INFO L208 MainTranslator]: Completed translation [2023-05-04 05:04:54,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54 WrapperNode [2023-05-04 05:04:54,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 05:04:54,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 05:04:54,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 05:04:54,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 05:04:54,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:54,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,056 INFO L138 Inliner]: procedures = 489, calls = 127, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1715 [2023-05-04 05:04:55,059 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 05:04:55,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 05:04:55,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 05:04:55,060 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 05:04:55,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,150 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,170 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 05:04:55,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 05:04:55,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 05:04:55,188 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 05:04:55,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (1/1) ... [2023-05-04 05:04:55,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 05:04:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:04:55,230 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) [2023-05-04 05:04:55,254 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 [2023-05-04 05:04:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2023-05-04 05:04:55,269 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 05:04:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-05-04 05:04:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 05:04:55,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 05:04:55,273 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 05:04:55,630 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 05:04:55,632 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 05:04:57,374 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 05:04:57,710 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 05:04:57,710 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2023-05-04 05:04:57,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 05:04:57 BoogieIcfgContainer [2023-05-04 05:04:57,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 05:04:57,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 05:04:57,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 05:04:57,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 05:04:57,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 05:04:54" (1/3) ... [2023-05-04 05:04:57,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c43da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 05:04:57, skipping insertion in model container [2023-05-04 05:04:57,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:54" (2/3) ... [2023-05-04 05:04:57,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c43da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 05:04:57, skipping insertion in model container [2023-05-04 05:04:57,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 05:04:57" (3/3) ... [2023-05-04 05:04:57,721 INFO L112 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2023-05-04 05:04:57,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 05:04:57,738 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 05:04:57,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-05-04 05:04:57,739 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 05:04:57,882 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 05:04:57,941 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 05:04:57,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 05:04:57,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:04:57,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 05:04:57,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 05:04:57,990 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 05:04:58,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 05:04:58,019 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1747704c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 05:04:58,019 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-05-04 05:04:58,370 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:04:58,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:58,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1244363970, now seen corresponding path program 1 times [2023-05-04 05:04:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:58,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249421572] [2023-05-04 05:04:58,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:58,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 05:04:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:58,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249421572] [2023-05-04 05:04:58,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249421572] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:58,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:58,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 05:04:58,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490296188] [2023-05-04 05:04:58,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:58,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 05:04:58,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:58,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 05:04:58,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 05:04:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:58,936 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:58,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.5) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 05:04:58,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:59,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 05:04:59,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:04:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:59,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1394094451, now seen corresponding path program 1 times [2023-05-04 05:04:59,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:59,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139213244] [2023-05-04 05:04:59,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:59,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 05:04:59,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:59,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139213244] [2023-05-04 05:04:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139213244] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:59,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:59,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 05:04:59,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697398638] [2023-05-04 05:04:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:59,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 05:04:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 05:04:59,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 05:04:59,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:59,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:59,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 05:04:59,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:59,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:59,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:04:59,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 05:04:59,846 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:04:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 752504048, now seen corresponding path program 1 times [2023-05-04 05:04:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:59,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437246566] [2023-05-04 05:04:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2023-05-04 05:05:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:01,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437246566] [2023-05-04 05:05:01,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437246566] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:01,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3245017] [2023-05-04 05:05:01,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:01,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:01,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:01,600 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) [2023-05-04 05:05:01,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 05:05:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:02,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 3232 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 05:05:02,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 05:05:02,539 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 05:05:02,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3245017] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:02,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 05:05:02,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 05:05:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884776623] [2023-05-04 05:05:02,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:02,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 05:05:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:02,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 05:05:02,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 05:05:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:02,544 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:02,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 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) [2023-05-04 05:05:02,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:02,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:02,546 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:02,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-04 05:05:02,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash -830802700, now seen corresponding path program 1 times [2023-05-04 05:05:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:02,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760683950] [2023-05-04 05:05:02,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-05-04 05:05:04,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760683950] [2023-05-04 05:05:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760683950] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:04,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760643451] [2023-05-04 05:05:04,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:04,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:04,392 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) [2023-05-04 05:05:04,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 05:05:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:05,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 3650 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 05:05:05,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:05,431 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-05-04 05:05:05,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 05:05:05,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760643451] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:05,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 05:05:05,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 05:05:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281241714] [2023-05-04 05:05:05,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:05,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 05:05:05,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:05,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 05:05:05,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 05:05:05,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:05,435 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:05,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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) [2023-05-04 05:05:05,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:05,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:05,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:05,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:12,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-05-04 05:05:13,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:13,085 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash -758007713, now seen corresponding path program 1 times [2023-05-04 05:05:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:13,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122545818] [2023-05-04 05:05:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:13,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:14,186 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-04 05:05:14,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:14,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122545818] [2023-05-04 05:05:14,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122545818] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:14,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512429945] [2023-05-04 05:05:14,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:14,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:14,189 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) [2023-05-04 05:05:14,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 05:05:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:15,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 3562 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 05:05:15,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-04 05:05:15,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 05:05:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-04 05:05:15,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512429945] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 05:05:15,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 05:05:15,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 05:05:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099057328] [2023-05-04 05:05:15,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 05:05:15,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 05:05:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 05:05:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 05:05:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:15,269 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:15,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.4) internal successors, (1004), 10 states have internal predecessors, (1004), 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) [2023-05-04 05:05:15,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:15,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:15,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:15,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:15,270 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:15,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:15,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:15,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:15,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:15,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1390433335, now seen corresponding path program 2 times [2023-05-04 05:05:15,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539302545] [2023-05-04 05:05:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2023-05-04 05:05:17,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:17,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539302545] [2023-05-04 05:05:17,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539302545] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:17,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222150008] [2023-05-04 05:05:17,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 05:05:17,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:17,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:17,073 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) [2023-05-04 05:05:17,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 05:05:17,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-04 05:05:17,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 05:05:17,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 05:05:17,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:17,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2023-05-04 05:05:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-05-04 05:05:17,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 05:05:17,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222150008] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:17,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 05:05:17,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-05-04 05:05:17,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756765980] [2023-05-04 05:05:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:17,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 05:05:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:17,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 05:05:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-05-04 05:05:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:17,886 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:17,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 197.2) internal successors, (986), 5 states have internal predecessors, (986), 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) [2023-05-04 05:05:17,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:17,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:17,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:17,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:17,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:17,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:18,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 05:05:18,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:18,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:18,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:18,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash -686245677, now seen corresponding path program 1 times [2023-05-04 05:05:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:18,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19191060] [2023-05-04 05:05:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:19,765 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2023-05-04 05:05:19,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:19,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19191060] [2023-05-04 05:05:19,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19191060] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:19,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306624560] [2023-05-04 05:05:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:19,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:19,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:19,767 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) [2023-05-04 05:05:19,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 05:05:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:20,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 3776 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 05:05:20,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-05-04 05:05:20,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 05:05:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-05-04 05:05:20,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306624560] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 05:05:20,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 05:05:20,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 11 [2023-05-04 05:05:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804400565] [2023-05-04 05:05:20,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 05:05:20,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 05:05:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 05:05:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-05-04 05:05:20,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:20,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:20,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 99.27272727272727) internal successors, (1092), 11 states have internal predecessors, (1092), 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) [2023-05-04 05:05:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 05:05:20,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:21,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 05:05:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 05:05:21,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:21,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:21,394 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1994662843, now seen corresponding path program 1 times [2023-05-04 05:05:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:21,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016791554] [2023-05-04 05:05:21,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:21,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 05:05:21,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 05:05:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 05:05:21,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 05:05:21,553 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 05:05:21,554 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-05-04 05:05:21,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-05-04 05:05:21,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-05-04 05:05:21,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-05-04 05:05:21,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-05-04 05:05:21,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-05-04 05:05:21,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 05:05:21,563 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2023-05-04 05:05:21,565 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-04 05:05:21,565 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-04 05:05:21,668 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 05:05:21,682 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 05:05:21,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 05:05:21,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:21,683 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 05:05:21,694 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 05:05:21,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 05:05:21,700 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@1747704c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 05:05:21,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-05-04 05:05:21,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-05-04 05:05:21,735 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash 122283950, now seen corresponding path program 1 times [2023-05-04 05:05:21,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055266618] [2023-05-04 05:05:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:05:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055266618] [2023-05-04 05:05:21,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055266618] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:21,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:05:21,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 05:05:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038264731] [2023-05-04 05:05:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:21,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 05:05:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 05:05:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 05:05:21,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:21,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:21,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 252.5) internal successors, (505), 2 states have internal predecessors, (505), 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) [2023-05-04 05:05:21,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:22,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 05:05:22,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2027616088, now seen corresponding path program 1 times [2023-05-04 05:05:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:22,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753175775] [2023-05-04 05:05:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:22,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-04 05:05:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753175775] [2023-05-04 05:05:22,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753175775] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:22,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:05:22,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 05:05:22,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300245330] [2023-05-04 05:05:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:22,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 05:05:22,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 05:05:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 05:05:22,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:22,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:22,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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) [2023-05-04 05:05:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:22,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:25,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:25,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 05:05:25,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1153304715, now seen corresponding path program 1 times [2023-05-04 05:05:25,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:25,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697841518] [2023-05-04 05:05:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:25,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-05-04 05:05:26,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:26,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697841518] [2023-05-04 05:05:26,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697841518] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:26,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857645924] [2023-05-04 05:05:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:26,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:26,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:26,970 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 05:05:26,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 05:05:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:28,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 4051 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 05:05:28,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:28,105 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2023-05-04 05:05:28,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 05:05:28,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857645924] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:28,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 05:05:28,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 05:05:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649231191] [2023-05-04 05:05:28,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:28,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 05:05:28,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:28,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 05:05:28,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 05:05:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:28,110 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:28,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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) [2023-05-04 05:05:28,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:28,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:28,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:29,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:29,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:29,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-05-04 05:05:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-04 05:05:29,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -779845161, now seen corresponding path program 1 times [2023-05-04 05:05:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:29,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242353687] [2023-05-04 05:05:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 05:05:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:29,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242353687] [2023-05-04 05:05:29,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242353687] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:29,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3706532] [2023-05-04 05:05:29,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:29,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:29,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:29,913 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 05:05:29,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 05:05:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:30,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 05:05:30,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-05-04 05:05:30,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 05:05:30,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3706532] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:30,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 05:05:30,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 05:05:30,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932485425] [2023-05-04 05:05:30,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:30,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 05:05:30,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:30,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 05:05:30,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 05:05:30,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:30,407 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:30,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2023-05-04 05:05:30,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:30,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:30,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:30,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:43,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:43,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:43,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:43,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:43,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash -125198710, now seen corresponding path program 1 times [2023-05-04 05:05:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:43,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996319208] [2023-05-04 05:05:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-05-04 05:05:44,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:44,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996319208] [2023-05-04 05:05:44,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996319208] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:44,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264253926] [2023-05-04 05:05:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:44,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:44,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:44,572 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 05:05:44,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 05:05:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:45,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 4415 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 05:05:45,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-05-04 05:05:45,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 05:05:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2023-05-04 05:05:45,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264253926] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 05:05:45,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 05:05:45,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 05:05:45,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079497368] [2023-05-04 05:05:45,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 05:05:45,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 05:05:45,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 05:05:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 05:05:45,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:45,934 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:45,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 111.7) internal successors, (1117), 10 states have internal predecessors, (1117), 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) [2023-05-04 05:05:45,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:45,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:45,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:45,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:45,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:46,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:46,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:46,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-04 05:05:46,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:46,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1680356340, now seen corresponding path program 2 times [2023-05-04 05:05:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:46,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656311509] [2023-05-04 05:05:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 467 trivial. 0 not checked. [2023-05-04 05:05:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656311509] [2023-05-04 05:05:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656311509] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:48,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:05:48,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 05:05:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956428081] [2023-05-04 05:05:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 05:05:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 05:05:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 05:05:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:48,295 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:48,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 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) [2023-05-04 05:05:48,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:48,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:48,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:48,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:48,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:48,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:48,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:48,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 05:05:48,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:48,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash 926700135, now seen corresponding path program 1 times [2023-05-04 05:05:48,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:48,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339341658] [2023-05-04 05:05:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:48,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 05:05:48,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:48,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339341658] [2023-05-04 05:05:48,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339341658] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:48,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967088135] [2023-05-04 05:05:48,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:48,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:48,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:48,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 05:05:48,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-04 05:05:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:49,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 05:05:49,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 05:05:49,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 05:05:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-04 05:05:49,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967088135] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 05:05:49,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 05:05:49,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-05-04 05:05:49,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375587533] [2023-05-04 05:05:49,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 05:05:49,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 05:05:49,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:49,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 05:05:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-05-04 05:05:49,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:49,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:49,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 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) [2023-05-04 05:05:49,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:49,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:49,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:05:49,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:49,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-05-04 05:05:49,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 461915570, now seen corresponding path program 2 times [2023-05-04 05:05:49,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:49,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505003002] [2023-05-04 05:05:49,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:49,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-04 05:05:49,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505003002] [2023-05-04 05:05:49,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505003002] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:49,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784586247] [2023-05-04 05:05:49,752 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 05:05:49,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:49,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:49,757 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 05:05:49,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-04 05:05:50,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 05:05:50,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 05:05:50,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 05:05:50,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-05-04 05:05:50,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 05:05:50,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784586247] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:50,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 05:05:50,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2023-05-04 05:05:50,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597904227] [2023-05-04 05:05:50,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:50,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 05:05:50,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:50,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 05:05:50,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-05-04 05:05:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:50,483 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:50,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 7 states have internal predecessors, (141), 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) [2023-05-04 05:05:50,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:50,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:50,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:50,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:50,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:50,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:50,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:05:50,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:05:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:56,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-04 05:05:56,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-05-04 05:05:56,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:05:56,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:05:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1804690271, now seen corresponding path program 1 times [2023-05-04 05:05:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:05:56,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758984267] [2023-05-04 05:05:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:05:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 200 proven. 1 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-05-04 05:05:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:05:58,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758984267] [2023-05-04 05:05:58,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758984267] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:05:58,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515787086] [2023-05-04 05:05:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:05:58,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:05:58,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:05:58,397 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 05:05:58,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-04 05:05:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:05:59,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 4827 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 05:05:59,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:05:59,957 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2023-05-04 05:05:59,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 05:05:59,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515787086] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:05:59,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 05:05:59,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-05-04 05:05:59,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951764553] [2023-05-04 05:05:59,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:05:59,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 05:05:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:05:59,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 05:05:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-05-04 05:05:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:59,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:05:59,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 258.4) internal successors, (1292), 5 states have internal predecessors, (1292), 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) [2023-05-04 05:05:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:05:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:59,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:05:59,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:05:59,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:05:59,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:06:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:06:00,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:06:00,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-04 05:06:00,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-04 05:06:00,461 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:06:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:06:00,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1370080734, now seen corresponding path program 1 times [2023-05-04 05:06:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:06:00,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222847264] [2023-05-04 05:06:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:06:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:06:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:06:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 503 trivial. 0 not checked. [2023-05-04 05:06:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:06:02,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222847264] [2023-05-04 05:06:02,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222847264] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:06:02,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:06:02,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-04 05:06:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969864417] [2023-05-04 05:06:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:06:02,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 05:06:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:06:02,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 05:06:02,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-05-04 05:06:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:06:02,303 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:06:02,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.4) internal successors, (1087), 5 states have internal predecessors, (1087), 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) [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:06:02,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:06:02,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:06:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 05:06:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-05-04 05:06:02,999 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-05-04 05:06:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:06:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1430792114, now seen corresponding path program 1 times [2023-05-04 05:06:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:06:03,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050036972] [2023-05-04 05:06:03,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:06:03,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:06:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:08:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-05-04 05:08:39,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:08:39,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050036972] [2023-05-04 05:08:39,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050036972] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 05:08:39,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743654339] [2023-05-04 05:08:39,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:08:39,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:08:39,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:08:39,674 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 05:08:39,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-04 05:08:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:08:41,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 4622 conjuncts, 314 conjunts are in the unsatisfiable core [2023-05-04 05:08:41,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 05:08:41,743 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 05:08:41,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2023-05-04 05:08:43,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 05:08:43,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 05:08:44,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 05:08:45,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 05:08:45,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 05:08:45,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 05:08:46,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 05:08:46,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 05:08:46,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 05:08:49,677 INFO L356 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2023-05-04 05:08:49,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 128 [2023-05-04 05:08:49,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 79 [2023-05-04 05:08:49,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 73 [2023-05-04 05:08:49,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 05:08:49,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-05-04 05:08:51,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:08:51,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 114 [2023-05-04 05:08:51,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 99 [2023-05-04 05:08:51,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 94 [2023-05-04 05:08:51,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 05:08:51,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 05:08:55,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 05:08:57,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 05:08:57,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:08:57,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 101 [2023-05-04 05:08:57,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 75 [2023-05-04 05:08:57,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2023-05-04 05:08:57,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2023-05-04 05:08:57,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2023-05-04 05:09:02,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 05:09:04,327 INFO L356 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2023-05-04 05:09:04,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 128 [2023-05-04 05:09:04,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 79 [2023-05-04 05:09:04,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 73 [2023-05-04 05:09:04,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 05:09:04,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-05-04 05:09:07,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:09:07,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 80 [2023-05-04 05:09:07,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2023-05-04 05:09:07,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2023-05-04 05:09:07,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 05:09:07,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 05:09:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 139 proven. 35 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2023-05-04 05:09:09,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 05:09:10,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:09:10,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2023-05-04 05:09:10,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:09:10,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2023-05-04 05:09:13,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2023-05-04 05:09:16,151 INFO L356 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-05-04 05:09:16,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 106 [2023-05-04 05:09:16,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 100 [2023-05-04 05:09:19,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:09:19,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 115 [2023-05-04 05:09:19,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:09:19,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 109 [2023-05-04 05:09:23,815 INFO L356 Elim1Store]: treesize reduction 4, result has 69.2 percent of original size [2023-05-04 05:09:23,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 106 [2023-05-04 05:09:23,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 200 treesize of output 188 [2023-05-04 05:09:27,131 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:09:27,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 106 [2023-05-04 05:09:27,140 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:09:27,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 100 [2023-05-04 05:09:29,062 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base|))) (let ((.cse1 (= (select .cse0 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|)))) (and (or (forall ((v_ArrVal_12878 Int)) (= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| (store .cse0 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| v_ArrVal_12878)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (not .cse1)) (not (= (+ 32 |c_~#q~0.offset|) 0)) (or (forall ((v_ArrVal_12881 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base| v_ArrVal_12881) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) .cse1)))) is different from false [2023-05-04 05:09:29,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2023-05-04 05:09:32,024 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse2 |c_~#q~0.base|) .cse1) .cse3) (not (= .cse3 0)))))))) is different from false [2023-05-04 05:09:32,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse2 0)) (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)))))))) is different from false [2023-05-04 05:09:32,296 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse2 |c_~#q~0.base|) .cse1) .cse3) (not (= .cse3 0)))))))) is different from false [2023-05-04 05:09:32,319 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-04 05:09:32,408 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12873 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12873) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse0))))) (forall ((v_ArrVal_12873 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12873) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-04 05:09:33,899 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= .cse0 (select (select .cse1 |c_~#q~0.base|) .cse2)))))) (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse2 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-04 05:09:33,913 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12872 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_#in~r#1.base| v_ArrVal_12872) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= .cse2 (select (select .cse3 |c_~#q~0.base|) .cse1)) (not (= .cse2 0)))))))) is different from false [2023-05-04 05:09:34,016 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|))) (and (forall ((v_ArrVal_12871 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12871) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_12871 (Array Int Int)) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_Init_ObjType_~r#1.base| v_ArrVal_12871) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse3 |c_~#q~0.base| (store (select .cse3 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-04 05:09:35,606 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base|))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_~obj#1.base| (store .cse2 |c_ULTIMATE.start_atomic_exchange_~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse3 |c_~#q~0.base|) .cse1) .cse4) (not (= .cse4 0)))))))) is different from false [2023-05-04 05:09:35,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base|))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store .cse3 |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse2 (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (= (select (select .cse0 |c_~#q~0.base|) .cse1) .cse2) (not (= .cse2 0)))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_atomic_exchange_#in~obj#1.base| (store .cse3 |c_ULTIMATE.start_atomic_exchange_#in~obj#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse4 |c_~#q~0.base| (store (select .cse4 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse4 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-04 05:09:38,180 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 32 |c_~#q~0.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base|))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base| (store .cse3 |c_ULTIMATE.start_writeV_#in~v#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse0 0)) (= (select (select .cse1 |c_~#q~0.base|) .cse2) .cse0))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_writeV_#in~v#1.base| (store .cse3 |c_ULTIMATE.start_writeV_#in~v#1.offset| v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (not (= (select (select .cse4 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse4 |c_~#q~0.base| (store (select .cse4 |c_~#q~0.base|) .cse2 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))))) is different from false [2023-05-04 05:09:39,869 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 32 |c_~#q~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#q~0.base|)) (.cse3 (+ 104 |c_~#q~0.offset|)) (.cse4 (+ |c_~#q~0.offset| 36))) (and (forall ((v_ArrVal_12869 Int) (v_ArrVal_12867 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse2 .cse3 v_ArrVal_12867) .cse4 v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (or (forall ((v_ArrVal_12903 Int)) (= (select (select (store .cse0 |c_~#q~0.base| (store (select .cse0 |c_~#q~0.base|) .cse1 v_ArrVal_12903)) |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0)) (not (= (select (select .cse0 |ULTIMATE.start_readV_~#expected~0#1.base|) 0) 0))))) (forall ((v_ArrVal_12869 Int) (v_ArrVal_12867 Int) (v_ArrVal_12874 (Array Int Int)) (v_ArrVal_12876 (Array Int Int)) (|ULTIMATE.start_readV_~#expected~0#1.base| Int)) (let ((.cse6 (store (store (store |c_#memory_int| |c_~#q~0.base| (store (store .cse2 .cse3 v_ArrVal_12867) .cse4 v_ArrVal_12869)) |c_~#items~0.base| v_ArrVal_12874) |c_ULTIMATE.start_main_~#handles~0#1.base| v_ArrVal_12876))) (let ((.cse5 (select (select .cse6 |ULTIMATE.start_readV_~#expected~0#1.base|) 0))) (or (not (= .cse5 0)) (= .cse5 (select (select .cse6 |c_~#q~0.base|) .cse1)))))))) is different from false [2023-05-04 05:09:40,017 INFO L356 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2023-05-04 05:09:40,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 137 treesize of output 95 [2023-05-04 05:09:40,046 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-05-04 05:09:40,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1529 treesize of output 1485 [2023-05-04 05:09:40,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1540 treesize of output 1502 [2023-05-04 05:09:40,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1694 treesize of output 1618 [2023-05-04 05:09:40,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 4 [2023-05-04 05:14:37,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:14:37,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 94 treesize of output 96 [2023-05-04 05:14:37,268 INFO L356 Elim1Store]: treesize reduction 45, result has 53.6 percent of original size [2023-05-04 05:14:37,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 133 treesize of output 91 [2023-05-04 05:14:37,297 INFO L356 Elim1Store]: treesize reduction 13, result has 65.8 percent of original size [2023-05-04 05:14:37,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 397 treesize of output 373 [2023-05-04 05:14:37,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:14:37,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 322 treesize of output 280 [2023-05-04 05:14:37,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:14:37,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 254 [2023-05-04 05:14:48,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 05:14:48,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 78 [2023-05-04 05:14:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 139 proven. 1 refuted. 2 times theorem prover too weak. 323 trivial. 41 not checked. [2023-05-04 05:14:48,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743654339] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 05:14:48,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 05:14:48,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 86, 77] total 248 [2023-05-04 05:14:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302094747] [2023-05-04 05:14:48,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 05:14:48,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 248 states [2023-05-04 05:14:48,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:14:48,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 248 interpolants. [2023-05-04 05:14:48,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1188, Invalid=53037, Unknown=817, NotChecked=6214, Total=61256 [2023-05-04 05:14:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:14:48,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:14:48,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 248 states, 248 states have (on average 8.883064516129032) internal successors, (2203), 248 states have internal predecessors, (2203), 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) [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 05:14:48,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:16:52,280 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base|)) (.cse1 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_#in~v#1.base|)) (.cse45 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|)) (.cse35 (+ |c_~#q~0.offset| 28)) (.cse15 (+ 104 |c_~#q~0.offset|)) (.cse36 (+ |c_~#q~0.offset| 24))) (let ((.cse51 (store (store (store .cse45 .cse35 0) .cse15 0) .cse36 0)) (.cse50 (store (store (store .cse1 .cse35 0) .cse15 0) .cse36 0)) (.cse10 (store (store (store .cse14 .cse35 0) .cse15 0) .cse36 0)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse11 (@diff .cse10 .cse5)) (.cse49 (@diff .cse50 .cse5)) (.cse52 (@diff .cse51 .cse5))) (let ((.cse16 (store .cse51 .cse52 0)) (.cse44 (store .cse50 .cse49 0)) (.cse42 (store .cse10 .cse11 0))) (let ((.cse41 (@diff .cse42 .cse5)) (.cse43 (@diff .cse44 .cse5)) (.cse17 (@diff .cse16 .cse5))) (let ((.cse7 (store .cse16 .cse17 0)) (.cse6 (store .cse44 .cse43 0)) (.cse23 (store .cse42 .cse41 0))) (let ((.cse24 (@diff .cse23 .cse5)) (.cse4 (@diff .cse6 .cse5)) (.cse8 (@diff .cse7 .cse5))) (let ((.cse53 (select .cse45 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|)) (.cse47 (store .cse7 .cse8 0)) (.cse13 (store .cse6 .cse4 0)) (.cse9 (select |c_#memory_int| |c_~#q~0.base|)) (.cse18 (store .cse23 .cse24 0))) (let ((.cse19 (@diff .cse18 .cse5)) (.cse2 (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset| 0)) (.cse21 (select |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base|)) (.cse20 (= .cse5 (store (store (store .cse9 .cse35 0) .cse15 0) .cse36 0))) (.cse12 (@diff .cse13 .cse5)) (.cse48 (@diff .cse47 .cse5)) (.cse46 (= .cse53 (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|))) (.cse22 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~v#1.base|)) (.cse3 (+ 32 |c_~#q~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|))) (and (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (= .cse0 0) (= |c_ULTIMATE.start_main_~#handles~0#1.offset| 0) (= |c_StealerThread1of2ForFork0_readV_#in~v#1.base| |c_~#q~0.base|) (= (select .cse1 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) 0) (or (not (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|)) .cse2) (not (= .cse3 0)) (or (<= .cse4 .cse3) (= .cse5 .cse6)) (or (= .cse5 .cse7) (<= .cse8 .cse3)) (= (select .cse9 .cse3) 0) (or (= .cse5 .cse10) (<= .cse11 .cse3)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (<= .cse3 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| |c_~#q~0.base|) (or (<= .cse12 .cse3) (= .cse5 .cse13)) (<= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (<= 1 (select .cse14 .cse15)) (<= 1 (select .cse9 .cse15)) (or (= .cse5 .cse16) (<= .cse17 .cse3)) (= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|) (= (select .cse14 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) .cse0) (= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (= .cse5 (store .cse18 .cse19 0)) (or .cse20 (= (select .cse21 .cse3) 0)) (= (select .cse22 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) .cse0) (or (= .cse5 .cse18) (<= .cse19 .cse3)) (or (= .cse5 .cse23) (<= .cse24 .cse3)) (let ((.cse26 (store (store (store .cse22 .cse35 0) .cse15 0) .cse36 0))) (let ((.cse34 (@diff .cse26 .cse5))) (let ((.cse28 (store .cse26 .cse34 0))) (let ((.cse33 (@diff .cse28 .cse5))) (let ((.cse25 (<= .cse34 .cse3)) (.cse29 (<= .cse33 .cse3)) (.cse27 (store .cse28 .cse33 0))) (or (and (or .cse25 (= .cse5 .cse26)) (= .cse5 .cse27) (or (= .cse5 .cse28) .cse29)) (let ((.cse30 (@diff .cse27 .cse5))) (let ((.cse32 (store .cse27 .cse30 0))) (let ((.cse31 (@diff .cse32 .cse5))) (and .cse25 (<= .cse30 .cse3) (or (<= .cse31 .cse3) (= .cse5 .cse32)) (= .cse5 (store .cse32 .cse31 0)) .cse29)))))))))) (= |c_~#q~0.offset| 0) (<= .cse3 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) (<= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| .cse3) (= 3 |c_~#q~0.base|) .cse2 (<= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| .cse3) (= .cse3 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) .cse20 (or (let ((.cse40 (store (store (store .cse21 .cse35 0) .cse15 0) .cse36 0))) (let ((.cse39 (@diff .cse40 .cse5))) (let ((.cse37 (store .cse40 .cse39 0))) (let ((.cse38 (@diff .cse37 .cse5))) (and (= |c_ULTIMATE.start_main_~#handles~0#1.base| |c_~#q~0.base|) (or (= .cse5 .cse37) (<= .cse38 .cse3)) (= .cse5 (store .cse37 .cse38 0)) (<= .cse39 .cse3)))))) .cse20) (= .cse5 (store .cse13 .cse12 0)) (= |c_~#items~0.base| 4) (or (<= .cse41 .cse3) (= .cse5 .cse42)) (or (<= .cse43 .cse3) (= .cse5 .cse44)) (<= .cse3 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| |c_~#q~0.base|) (= |c_StealerThread1of2ForFork0_readV_~v#1.base| |c_~#q~0.base|) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| 0) (= .cse3 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) (or (forall ((v_ArrVal_12878 Int)) (= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| (store .cse45 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| v_ArrVal_12878)) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (not .cse46)) (= .cse5 (store .cse47 .cse48 0)) (<= 1 (select .cse45 .cse15)) (or (<= .cse49 .cse3) (= .cse5 .cse50)) (<= |c_StealerThread1of2ForFork0_readV_#in~v#1.offset| .cse3) (or (<= .cse48 .cse3) (= .cse5 .cse47)) (<= 1 (select .cse1 .cse15)) (not (= |c_~#items~0.base| |c_~#q~0.base|)) (or (= .cse5 .cse51) (<= .cse52 .cse3)) (or .cse46 (forall ((v_ArrVal_12881 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base| v_ArrVal_12881) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0))) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) (<= 1 (select .cse22 .cse15)) (<= |c_StealerThread1of2ForFork0_readV_~v#1.offset| .cse3) (= .cse53 .cse0))))))))))) is different from true [2023-05-04 05:17:21,796 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_readV_~v#1.base|)) (.cse11 (+ 104 |c_~#q~0.offset|))) (let ((.cse17 (store (store (store .cse10 (+ |c_~#q~0.offset| 28) 0) .cse11 0) (+ |c_~#q~0.offset| 24) 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse16 (@diff .cse17 .cse2))) (let ((.cse19 (store .cse17 .cse16 0))) (let ((.cse18 (@diff .cse19 .cse2))) (let ((.cse15 (store .cse19 .cse18 0))) (let ((.cse14 (@diff .cse15 .cse2))) (let ((.cse12 (store .cse15 .cse14 0))) (let ((.cse13 (@diff .cse12 .cse2))) (let ((.cse3 (store .cse12 .cse13 0)) (.cse8 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|))) (let ((.cse0 (= (select .cse8 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0)) (.cse1 (+ |c_~#q~0.offset| 36)) (.cse4 (@diff .cse3 .cse2))) (and .cse0 (<= |c_ULTIMATE.start_readV_~v#1.offset| .cse1) (= .cse2 (store .cse3 .cse4 0)) (let ((.cse7 (select |c_#memory_int| |c_~#q~0.base|))) (or (and .cse0 (let ((.cse6 (+ 32 |c_~#q~0.offset|))) (or (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (v_ArrVal_12878 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#q~0.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| v_DerPreprocessor_2) |c_~#q~0.base|))) (and (= (store .cse5 .cse6 v_ArrVal_12878) .cse7) (= (select .cse5 .cse6) 0)))) (and (exists ((v_ArrVal_12878 Int)) (= (store .cse8 .cse6 v_ArrVal_12878) .cse7)) (= (select .cse8 .cse6) 0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#q~0.base| v_DerPreprocessor_1) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| v_DerPreprocessor_2) |c_~#q~0.base|))) (and (= .cse9 v_DerPreprocessor_1) (= .cse8 .cse9)))))))) (and (= (select .cse7 |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|) 0) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_~#q~0.base|)))) (<= .cse1 |c_ULTIMATE.start_readV_~v#1.offset|) (<= 1 (select .cse10 .cse11)) (= |c_~#q~0.offset| 0) (= 3 |c_~#q~0.base|) (or (= .cse2 .cse12) (<= (+ .cse13 4) |c_ULTIMATE.start_readV_~v#1.offset|)) (= |c_~#q~0.base| |c_ULTIMATE.start_readV_~v#1.base|) (or (= .cse2 .cse3) (<= (+ .cse4 4) |c_ULTIMATE.start_readV_~v#1.offset|)) (or (<= (+ 4 .cse14) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse2 .cse15)) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| 0) (or (<= (+ .cse16 4) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse2 .cse17)) (or (<= (+ .cse18 4) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse2 .cse19)) (not (= |c_~#items~0.base| |c_~#q~0.base|)))))))))))))) is different from true [2023-05-04 05:17:23,888 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| |c_ULTIMATE.start_readV_~v#1.base|)) (.cse37 (+ |c_~#q~0.offset| 28)) (.cse17 (+ 104 |c_~#q~0.offset|)) (.cse38 (+ |c_~#q~0.offset| 24))) (let ((.cse63 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|)) (.cse67 (store (store (store .cse18 .cse37 0) .cse17 0) .cse38 0)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse16 (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base|)) (.cse66 (@diff .cse67 .cse7)) (.cse2 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_#in~v#1.base|)) (.cse78 (store (store (store .cse63 .cse37 0) .cse17 0) .cse38 0))) (let ((.cse73 (@diff .cse78 .cse7)) (.cse65 (store (store (store .cse2 .cse37 0) .cse17 0) .cse38 0)) (.cse69 (store .cse67 .cse66 0)) (.cse10 (store (store (store .cse16 .cse37 0) .cse17 0) .cse38 0))) (let ((.cse11 (@diff .cse10 .cse7)) (.cse68 (@diff .cse69 .cse7)) (.cse64 (@diff .cse65 .cse7)) (.cse79 (store .cse78 .cse73 0))) (let ((.cse74 (@diff .cse79 .cse7)) (.cse62 (store .cse65 .cse64 0)) (.cse58 (store .cse69 .cse68 0)) (.cse60 (store .cse10 .cse11 0))) (let ((.cse59 (@diff .cse60 .cse7)) (.cse57 (@diff .cse58 .cse7)) (.cse61 (@diff .cse62 .cse7)) (.cse80 (store .cse79 .cse74 0))) (let ((.cse77 (@diff .cse80 .cse7)) (.cse8 (store .cse62 .cse61 0)) (.cse39 (store .cse58 .cse57 0)) (.cse25 (store .cse60 .cse59 0))) (let ((.cse26 (@diff .cse25 .cse7)) (.cse40 (@diff .cse39 .cse7)) (.cse5 (@diff .cse8 .cse7)) (.cse75 (store .cse80 .cse77 0))) (let ((.cse76 (@diff .cse75 .cse7)) (.cse15 (store .cse8 .cse5 0)) (.cse12 (store .cse39 .cse40 0)) (.cse9 (select |c_#memory_int| |c_~#q~0.base|)) (.cse19 (store .cse25 .cse26 0))) (let ((.cse0 (+ |c_~#q~0.offset| 36)) (.cse20 (@diff .cse19 .cse7)) (.cse3 (not (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base|))) (.cse4 (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset| 0)) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#handles~0#1.base|)) (.cse21 (= .cse7 (store (store (store .cse9 .cse37 0) .cse17 0) .cse38 0))) (.cse13 (@diff .cse12 .cse7)) (.cse14 (@diff .cse15 .cse7)) (.cse45 (= .cse7 .cse80)) (.cse48 (= .cse7 .cse79)) (.cse49 (= .cse7 .cse78)) (.cse51 (+ .cse76 4)) (.cse52 (= .cse7 .cse75)) (.cse53 (+ .cse77 4)) (.cse54 (= .cse7 (store .cse75 .cse76 0))) (.cse56 (+ .cse74 4)) (.cse55 (+ .cse73 4)) (.cse23 (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~v#1.base|)) (.cse6 (+ 32 |c_~#q~0.offset|)) (.cse24 (select .cse63 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|)) (.cse1 (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base|) |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_readV_#in~v#1.offset|) (not (= 3 |c_ULTIMATE.start_main_~#handles~0#1.base|)) (= .cse1 0) (= |c_ULTIMATE.start_main_~#handles~0#1.offset| 0) (= |c_StealerThread1of2ForFork0_readV_#in~v#1.base| |c_~#q~0.base|) (<= |c_ULTIMATE.start_readV_~v#1.offset| .cse0) (= (select .cse2 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) 0) (or .cse3 .cse4) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) (or (<= .cse5 .cse6) (= .cse7 .cse8)) (= (select .cse9 .cse6) 0) (or (= .cse7 .cse10) (<= .cse11 .cse6)) (= |c_ULTIMATE.start_main_~i~2#1| 0) (= .cse7 (store .cse12 .cse13 0)) (<= .cse6 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.base| |c_~#q~0.base|) (or (<= .cse14 .cse6) (= .cse7 .cse15)) (<= .cse6 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (<= 1 (select .cse16 .cse17)) (<= 1 (select .cse9 .cse17)) (<= |c_ULTIMATE.start_readV_#in~v#1.offset| .cse0) (<= .cse0 |c_ULTIMATE.start_readV_~v#1.offset|) (<= 1 (select .cse18 .cse17)) (= .cse6 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.offset|) (= (select .cse16 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) .cse1) (= .cse6 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset|) (= .cse7 (store .cse19 .cse20 0)) (or .cse21 (= (select .cse22 .cse6) 0)) (= (select .cse23 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) .cse1) (or (= .cse7 .cse19) (<= .cse20 .cse6)) (= .cse24 (select (select |c_#memory_int| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.base|) |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|)) (or (= .cse7 .cse25) (<= .cse26 .cse6)) (let ((.cse28 (store (store (store .cse23 .cse37 0) .cse17 0) .cse38 0))) (let ((.cse36 (@diff .cse28 .cse7))) (let ((.cse30 (store .cse28 .cse36 0))) (let ((.cse35 (@diff .cse30 .cse7))) (let ((.cse27 (<= .cse36 .cse6)) (.cse31 (<= .cse35 .cse6)) (.cse29 (store .cse30 .cse35 0))) (or (and (or .cse27 (= .cse7 .cse28)) (= .cse7 .cse29) (or (= .cse7 .cse30) .cse31)) (let ((.cse32 (@diff .cse29 .cse7))) (let ((.cse34 (store .cse29 .cse32 0))) (let ((.cse33 (@diff .cse34 .cse7))) (and .cse27 (<= .cse32 .cse6) (or (<= .cse33 .cse6) (= .cse7 .cse34)) (= .cse7 (store .cse34 .cse33 0)) .cse31)))))))))) (= |c_~#q~0.offset| 0) (<= .cse6 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) (<= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| .cse6) (= 3 |c_~#q~0.base|) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|) (or .cse3 (not (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~expected#1.offset|))) (or (= .cse7 .cse39) (<= (+ .cse40 4) |c_ULTIMATE.start_readV_~v#1.offset|)) (= |c_ULTIMATE.start_readV_#in~v#1.base| |c_~#q~0.base|) .cse4 (<= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~obj#1.offset| .cse6) (= .cse6 |c_StealerThread1of2ForFork0_readV_#in~v#1.offset|) .cse21 (= |c_~#q~0.base| |c_ULTIMATE.start_readV_~v#1.base|) (or (let ((.cse44 (store (store (store .cse22 .cse37 0) .cse17 0) .cse38 0))) (let ((.cse43 (@diff .cse44 .cse7))) (let ((.cse41 (store .cse44 .cse43 0))) (let ((.cse42 (@diff .cse41 .cse7))) (and (= |c_ULTIMATE.start_main_~#handles~0#1.base| |c_~#q~0.base|) (or (= .cse7 .cse41) (<= .cse42 .cse6)) (= .cse7 (store .cse41 .cse42 0)) (<= .cse43 .cse6)))))) .cse21) (or (= .cse7 .cse12) (<= (+ .cse13 4) |c_ULTIMATE.start_readV_~v#1.offset|)) (= .cse7 (store .cse15 .cse14 0)) (= |c_~#items~0.base| 4) (let ((.cse47 (<= .cse56 |c_ULTIMATE.start_readV_#in~v#1.offset|)) (.cse46 (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| |c_ULTIMATE.start_readV_#in~v#1.base|)) (.cse50 (<= .cse55 |c_ULTIMATE.start_readV_#in~v#1.offset|))) (or (and .cse45 .cse46 (or .cse47 .cse48) (or .cse49 .cse50)) (and .cse47 (or (<= .cse51 |c_ULTIMATE.start_readV_#in~v#1.offset|) .cse52) .cse46 .cse50 (<= .cse53 |c_ULTIMATE.start_readV_#in~v#1.offset|) .cse54))) (or (<= (+ 4 .cse57) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse7 .cse58)) (or (<= .cse59 .cse6) (= .cse7 .cse60)) (or (<= .cse61 .cse6) (= .cse7 .cse62)) (<= .cse6 |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.offset|) (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| |c_~#q~0.base|) (= |c_StealerThread1of2ForFork0_readV_~v#1.base| |c_~#q~0.base|) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.offset| 0) (= .cse6 |c_StealerThread1of2ForFork0_readV_~v#1.offset|) (<= 1 (select .cse63 .cse17)) (or (<= .cse64 .cse6) (= .cse7 .cse65)) (<= |c_StealerThread1of2ForFork0_readV_#in~v#1.offset| .cse6) (or (<= (+ .cse66 4) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse7 .cse67)) (<= 1 (select .cse2 .cse17)) (or (<= (+ .cse68 4) |c_ULTIMATE.start_readV_~v#1.offset|) (= .cse7 .cse69)) (= |c_ULTIMATE.start_readV_~#expected~0#1.offset| 0) (not (= |c_~#items~0.base| |c_~#q~0.base|)) (let ((.cse70 (= |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_~obj#1.base| |c_ULTIMATE.start_readV_~v#1.base|)) (.cse72 (<= .cse55 |c_ULTIMATE.start_readV_~v#1.offset|)) (.cse71 (<= .cse56 |c_ULTIMATE.start_readV_~v#1.offset|))) (or (and .cse70 .cse45 (or .cse48 .cse71) (or .cse49 .cse72)) (and .cse70 (or (<= .cse51 |c_ULTIMATE.start_readV_~v#1.offset|) .cse52) .cse72 (<= .cse53 |c_ULTIMATE.start_readV_~v#1.offset|) .cse71 .cse54))) (= |c_StealerThread1of2ForFork0_readV_~#expected~0#1.base| |c_StealerThread1of2ForFork0_atomic_compare_exchange_strong_#in~expected#1.base|) (<= 1 (select .cse23 .cse17)) (<= |c_StealerThread1of2ForFork0_readV_~v#1.offset| .cse6) (= .cse24 .cse1))))))))))))) is different from true Received shutdown request... [2023-05-04 05:17:44,511 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 [2023-05-04 05:17:44,514 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 05:17:44,520 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 05:17:44,525 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 05:17:44,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-05-04 05:17:44,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 05:17:44,737 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 299 known predicates. [2023-05-04 05:17:44,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-05-04 05:17:44,737 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-05-04 05:17:44,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-05-04 05:17:44,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-05-04 05:17:44,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-05-04 05:17:44,738 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-05-04 05:17:44,740 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 05:17:44,742 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-05-04 05:17:44,742 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 05:17:44,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 05:17:44 BasicIcfg [2023-05-04 05:17:44,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 05:17:44,745 INFO L158 Benchmark]: Toolchain (without parser) took 770725.93ms. Allocated memory was 196.1MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 158.3MB in the beginning and 390.7MB in the end (delta: -232.3MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-05-04 05:17:44,745 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 05:17:44,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 902.47ms. Allocated memory is still 196.1MB. Free memory was 158.0MB in the beginning and 117.3MB in the end (delta: 40.7MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-05-04 05:17:44,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.73ms. Allocated memory is still 196.1MB. Free memory was 117.3MB in the beginning and 107.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-05-04 05:17:44,746 INFO L158 Benchmark]: Boogie Preprocessor took 128.08ms. Allocated memory is still 196.1MB. Free memory was 107.9MB in the beginning and 99.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-05-04 05:17:44,746 INFO L158 Benchmark]: RCFGBuilder took 2525.82ms. Allocated memory was 196.1MB in the beginning and 273.7MB in the end (delta: 77.6MB). Free memory was 99.5MB in the beginning and 188.7MB in the end (delta: -89.1MB). Peak memory consumption was 90.7MB. Max. memory is 8.0GB. [2023-05-04 05:17:44,746 INFO L158 Benchmark]: TraceAbstraction took 767028.80ms. Allocated memory was 273.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 187.6MB in the beginning and 390.7MB in the end (delta: -203.1MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-05-04 05:17:44,747 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 902.47ms. Allocated memory is still 196.1MB. Free memory was 158.0MB in the beginning and 117.3MB in the end (delta: 40.7MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 130.73ms. Allocated memory is still 196.1MB. Free memory was 117.3MB in the beginning and 107.9MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 128.08ms. Allocated memory is still 196.1MB. Free memory was 107.9MB in the beginning and 99.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2525.82ms. Allocated memory was 196.1MB in the beginning and 273.7MB in the end (delta: 77.6MB). Free memory was 99.5MB in the beginning and 188.7MB in the end (delta: -89.1MB). Peak memory consumption was 90.7MB. Max. memory is 8.0GB. * TraceAbstraction took 767028.80ms. Allocated memory was 273.7MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 187.6MB in the beginning and 390.7MB in the end (delta: -203.1MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 269074, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 1125, dependent conditional: 1085, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 16, unknown conditional: 8, unknown unconditional: 8] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167747, independent: 167702, independent conditional: 0, independent unconditional: 167702, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167747, independent: 167685, independent conditional: 0, independent unconditional: 167685, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6278, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 540, dependent conditional: 0, dependent unconditional: 540, unknown: 5601, unknown conditional: 0, unknown unconditional: 5601] , Protected Queries: 0 ], Cache Queries: [ total: 268008, independent: 100239, independent conditional: 0, independent unconditional: 100239, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 167758, unknown conditional: 0, unknown unconditional: 167758] , Statistics on independence cache: Total cache size (in pairs): 167742, Positive cache size: 167702, Positive conditional cache size: 0, Positive unconditional cache size: 167702, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 16, Maximal queried relation: 3, Independence queries for same thread: 1082 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 7.3s, Number of persistent set computation: 1604, Number of trivial persistent sets: 1604, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267020, independent: 266975, independent conditional: 0, independent unconditional: 266975, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 269074, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 1125, dependent conditional: 1085, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 267992, independent: 267941, independent conditional: 966, independent unconditional: 266975, dependent: 43, dependent conditional: 3, dependent unconditional: 40, unknown: 8, unknown conditional: 3, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 8, dependent unconditional: 43, unknown: 16, unknown conditional: 8, unknown unconditional: 8] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 268008, independent: 267941, independent conditional: 0, independent unconditional: 267941, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 167747, independent: 167702, independent conditional: 0, independent unconditional: 167702, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 167747, independent: 167685, independent conditional: 0, independent unconditional: 167685, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6278, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 540, dependent conditional: 0, dependent unconditional: 540, unknown: 5601, unknown conditional: 0, unknown unconditional: 5601] , Protected Queries: 0 ], Cache Queries: [ total: 268008, independent: 100239, independent conditional: 0, independent unconditional: 100239, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 167758, unknown conditional: 0, unknown unconditional: 167758] , Statistics on independence cache: Total cache size (in pairs): 167742, Positive cache size: 167702, Positive conditional cache size: 0, Positive unconditional cache size: 167702, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 16, Maximal queried relation: 3, Independence queries for same thread: 1082 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 765381, independent: 762757, independent conditional: 6439, independent unconditional: 756318, dependent: 2609, dependent conditional: 2401, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763008, independent: 762757, independent conditional: 6439, independent unconditional: 756318, dependent: 236, dependent conditional: 28, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763008, independent: 762757, independent conditional: 6439, independent unconditional: 756318, dependent: 236, dependent conditional: 28, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763146, independent: 762757, independent conditional: 0, independent unconditional: 762757, dependent: 374, dependent conditional: 138, dependent unconditional: 236, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763146, independent: 762757, independent conditional: 0, independent unconditional: 762757, dependent: 374, dependent conditional: 12, dependent unconditional: 362, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763146, independent: 762757, independent conditional: 0, independent unconditional: 762757, dependent: 374, dependent conditional: 12, dependent unconditional: 362, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 455410, independent: 455181, independent conditional: 0, independent unconditional: 455181, dependent: 214, dependent conditional: 6, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 455410, independent: 455111, independent conditional: 0, independent unconditional: 455111, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 299, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 214, dependent conditional: 6, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 299, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 214, dependent conditional: 6, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20293, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 2460, dependent conditional: 41, dependent unconditional: 2419, unknown: 17476, unknown conditional: 0, unknown unconditional: 17476] , Protected Queries: 0 ], Cache Queries: [ total: 763146, independent: 307576, independent conditional: 0, independent unconditional: 307576, dependent: 160, dependent conditional: 6, dependent unconditional: 154, unknown: 455410, unknown conditional: 6, unknown unconditional: 455404] , Statistics on independence cache: Total cache size (in pairs): 455395, Positive cache size: 455181, Positive conditional cache size: 0, Positive unconditional cache size: 455181, Negative cache size: 214, Negative conditional cache size: 6, Negative unconditional cache size: 208, Unknown cache size: 15, Unknown conditional cache size: 0, Unknown unconditional cache size: 15, Eliminated conditions: 126, Maximal queried relation: 8, Independence queries for same thread: 2373 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 22.0s, Number of persistent set computation: 3844, Number of trivial persistent sets: 3638, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 756541, independent: 756318, independent conditional: 0, independent unconditional: 756318, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 765381, independent: 762757, independent conditional: 6439, independent unconditional: 756318, dependent: 2609, dependent conditional: 2401, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763008, independent: 762757, independent conditional: 6439, independent unconditional: 756318, dependent: 236, dependent conditional: 28, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763008, independent: 762757, independent conditional: 6439, independent unconditional: 756318, dependent: 236, dependent conditional: 28, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763146, independent: 762757, independent conditional: 0, independent unconditional: 762757, dependent: 374, dependent conditional: 138, dependent unconditional: 236, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763146, independent: 762757, independent conditional: 0, independent unconditional: 762757, dependent: 374, dependent conditional: 12, dependent unconditional: 362, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763146, independent: 762757, independent conditional: 0, independent unconditional: 762757, dependent: 374, dependent conditional: 12, dependent unconditional: 362, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 455410, independent: 455181, independent conditional: 0, independent unconditional: 455181, dependent: 214, dependent conditional: 6, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 455410, independent: 455111, independent conditional: 0, independent unconditional: 455111, dependent: 299, dependent conditional: 0, dependent unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 299, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 214, dependent conditional: 6, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 299, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 214, dependent conditional: 6, dependent unconditional: 208, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20293, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 2460, dependent conditional: 41, dependent unconditional: 2419, unknown: 17476, unknown conditional: 0, unknown unconditional: 17476] , Protected Queries: 0 ], Cache Queries: [ total: 763146, independent: 307576, independent conditional: 0, independent unconditional: 307576, dependent: 160, dependent conditional: 6, dependent unconditional: 154, unknown: 455410, unknown conditional: 6, unknown unconditional: 455404] , Statistics on independence cache: Total cache size (in pairs): 455395, Positive cache size: 455181, Positive conditional cache size: 0, Positive unconditional cache size: 455181, Negative cache size: 214, Negative conditional cache size: 6, Negative unconditional cache size: 208, Unknown cache size: 15, Unknown conditional cache size: 0, Unknown unconditional cache size: 15, Eliminated conditions: 126, Maximal queried relation: 8, Independence queries for same thread: 2373 - TimeoutResultAtElement [Line: 1793]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 299 known predicates. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 299 known predicates. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 299 known predicates. - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 299 known predicates. - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 299 known predicates. - TimeoutResultAtElement [Line: 1952]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 299 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 1764 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 23.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 9.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 12678 NumberOfCodeBlocks, 11931 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 15059 ConstructedInterpolants, 0 QuantifiedInterpolants, 15404 SizeOfPredicates, 12 NumberOfNonLiveVariables, 15665 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 3574/3647 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 1909 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 743.1s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 201.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 529.4s InterpolantComputationTime, 17157 NumberOfCodeBlocks, 17157 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 20436 ConstructedInterpolants, 250 QuantifiedInterpolants, 172713 SizeOfPredicates, 173 NumberOfNonLiveVariables, 19383 ConjunctsInSsa, 340 ConjunctsInUnsatCore, 21 InterpolantComputations, 8 PerfectInterpolantSequences, 6138/6344 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