/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/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 04:32:27,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 04:32:27,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 04:32:27,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 04:32:27,043 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 04:32:27,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 04:32:27,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 04:32:27,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 04:32:27,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 04:32:27,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 04:32:27,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 04:32:27,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 04:32:27,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 04:32:27,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 04:32:27,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 04:32:27,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 04:32:27,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 04:32:27,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 04:32:27,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 04:32:27,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 04:32:27,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 04:32:27,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 04:32:27,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 04:32:27,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 04:32:27,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 04:32:27,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 04:32:27,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 04:32:27,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 04:32:27,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 04:32:27,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 04:32:27,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 04:32:27,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 04:32:27,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 04:32:27,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 04:32:27,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 04:32:27,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 04:32:27,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 04:32:27,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 04:32:27,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 04:32:27,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 04:32:27,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 04:32:27,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 04:32:27,128 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 04:32:27,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 04:32:27,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 04:32:27,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 04:32:27,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 04:32:27,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 04:32:27,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 04:32:27,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 04:32:27,130 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 04:32:27,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 04:32:27,130 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 04:32:27,131 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 04:32:27,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 04:32:27,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 04:32:27,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 04:32:27,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 04:32:27,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 04:32:27,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 04:32:27,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 04:32:27,133 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 04:32:27,134 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 04:32:27,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 04:32:27,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 04:32:27,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 04:32:27,351 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 04:32:27,352 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 04:32:27,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-05-04 04:32:27,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1d61d1e/1bffcb27b0924bc4b230c244620170c0/FLAGb93b59cd5 [2023-05-04 04:32:27,853 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 04:32:27,854 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-05-04 04:32:27,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1d61d1e/1bffcb27b0924bc4b230c244620170c0/FLAGb93b59cd5 [2023-05-04 04:32:28,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1d61d1e/1bffcb27b0924bc4b230c244620170c0 [2023-05-04 04:32:28,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 04:32:28,394 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 04:32:28,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 04:32:28,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 04:32:28,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 04:32:28,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:32:28" (1/1) ... [2023-05-04 04:32:28,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6282542e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:28, skipping insertion in model container [2023-05-04 04:32:28,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 04:32:28" (1/1) ... [2023-05-04 04:32:28,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 04:32:28,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 04:32:28,919 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/queue_longest.i[43296,43309] [2023-05-04 04:32:28,928 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/queue_longest.i[43503,43516] [2023-05-04 04:32:28,933 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/queue_longest.i[43783,43796] [2023-05-04 04:32:28,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 04:32:28,946 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 04:32:28,993 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/queue_longest.i[43296,43309] [2023-05-04 04:32:28,994 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/queue_longest.i[43503,43516] [2023-05-04 04:32:28,996 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/queue_longest.i[43783,43796] [2023-05-04 04:32:28,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 04:32:29,060 INFO L208 MainTranslator]: Completed translation [2023-05-04 04:32:29,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29 WrapperNode [2023-05-04 04:32:29,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 04:32:29,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 04:32:29,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 04:32:29,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 04:32:29,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,105 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,147 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-05-04 04:32:29,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 04:32:29,149 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 04:32:29,149 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 04:32:29,149 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 04:32:29,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,205 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 04:32:29,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 04:32:29,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 04:32:29,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 04:32:29,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (1/1) ... [2023-05-04 04:32:29,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 04:32:29,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:29,246 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 04:32:29,273 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 04:32:29,288 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 04:32:29,289 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 04:32:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 04:32:29,289 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 04:32:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 04:32:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 04:32:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 04:32:29,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 04:32:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 04:32:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 04:32:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 04:32:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 04:32:29,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 04:32:29,292 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 04:32:29,455 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 04:32:29,457 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 04:32:29,797 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 04:32:29,807 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 04:32:29,808 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 04:32:29,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:32:29 BoogieIcfgContainer [2023-05-04 04:32:29,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 04:32:29,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 04:32:29,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 04:32:29,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 04:32:29,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 04:32:28" (1/3) ... [2023-05-04 04:32:29,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2989aadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:32:29, skipping insertion in model container [2023-05-04 04:32:29,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 04:32:29" (2/3) ... [2023-05-04 04:32:29,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2989aadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:32:29, skipping insertion in model container [2023-05-04 04:32:29,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:32:29" (3/3) ... [2023-05-04 04:32:29,818 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-05-04 04:32:29,824 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 04:32:29,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 04:32:29,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 04:32:29,833 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 04:32:29,965 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 04:32:30,048 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:32:30,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:32:30,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:30,053 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 04:32:30,067 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 04:32:30,107 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:32:30,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 04:32:30,146 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;@22e0e20c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:32:30,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:32:30,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash 215206652, now seen corresponding path program 1 times [2023-05-04 04:32:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:30,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269465848] [2023-05-04 04:32:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:30,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:31,976 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 04:32:31,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:31,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269465848] [2023-05-04 04:32:31,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269465848] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:31,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:31,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 04:32:31,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15941826] [2023-05-04 04:32:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:31,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 04:32:31,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 04:32:32,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 04:32:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:32,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:32,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 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 04:32:32,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:32,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 04:32:32,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:32,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1274971090, now seen corresponding path program 1 times [2023-05-04 04:32:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:32,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873145815] [2023-05-04 04:32:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:32,690 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 04:32:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:32,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873145815] [2023-05-04 04:32:32,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873145815] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:32,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:32,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:32:32,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430323565] [2023-05-04 04:32:32,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:32,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:32:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:32,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:32:32,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:32:32,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:32,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:32,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 04:32:32,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:32,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:32,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:32,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 04:32:32,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1662794902, now seen corresponding path program 1 times [2023-05-04 04:32:32,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:32,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479070762] [2023-05-04 04:32:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:32,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:32,863 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 04:32:32,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:32,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479070762] [2023-05-04 04:32:32,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479070762] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:32,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:32,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 04:32:32,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132923912] [2023-05-04 04:32:32,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:32,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 04:32:32,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:32,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 04:32:32,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 04:32:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:32,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:32,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 04:32:32,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:32,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:32,875 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:32,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 04:32:32,909 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1133987975, now seen corresponding path program 1 times [2023-05-04 04:32:32,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:32,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335604420] [2023-05-04 04:32:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:32,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:41,703 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 04:32:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:41,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335604420] [2023-05-04 04:32:41,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335604420] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:41,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:41,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 04:32:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125999901] [2023-05-04 04:32:41,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:41,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 04:32:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:41,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 04:32:41,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-05-04 04:32:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:41,707 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:41,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.517241379310345) internal successors, (131), 29 states have internal predecessors, (131), 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 04:32:41,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:41,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:41,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:41,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 04:32:44,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 04:32:44,693 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1285883828, now seen corresponding path program 1 times [2023-05-04 04:32:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:44,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203099314] [2023-05-04 04:32:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:44,759 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 04:32:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:44,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203099314] [2023-05-04 04:32:44,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203099314] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:44,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:44,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 04:32:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748014035] [2023-05-04 04:32:44,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:44,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 04:32:44,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:44,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 04:32:44,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 04:32:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:44,762 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:44,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 04:32:44,763 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:44,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:44,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:44,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 04:32:44,764 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:32:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:46,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 04:32:46,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:46,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -152943195, now seen corresponding path program 2 times [2023-05-04 04:32:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:46,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55134705] [2023-05-04 04:32:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:49,838 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 04:32:49,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:49,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55134705] [2023-05-04 04:32:49,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55134705] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:49,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:49,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-05-04 04:32:49,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850864195] [2023-05-04 04:32:49,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:49,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-05-04 04:32:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:49,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-05-04 04:32:49,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2023-05-04 04:32:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:49,840 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:49,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 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 04:32:49,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:49,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:49,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:49,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:32:49,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:49,841 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:32:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:53,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 04:32:53,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 04:32:53,362 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1358128959, now seen corresponding path program 1 times [2023-05-04 04:32:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:53,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297833398] [2023-05-04 04:32:53,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:53,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:53,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297833398] [2023-05-04 04:32:53,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297833398] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:53,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:53,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:32:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962438815] [2023-05-04 04:32:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:53,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:32:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:32:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:32:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:53,441 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:53,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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 04:32:53,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:53,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:53,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:53,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:32:53,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:53,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 04:32:53,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-04 04:32:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 04:32:53,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 04:32:53,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:53,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 04:32:53,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 04:32:53,620 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-05-04 04:32:53,621 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 04:32:53,626 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:32:53,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:32:53,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:53,629 INFO L229 MonitoredProcess]: Starting monitored process 3 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 04:32:53,698 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:32:53,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 04:32:53,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 04:32:53,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;@22e0e20c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:32:53,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 04:32:53,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 04:32:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1422695656, now seen corresponding path program 1 times [2023-05-04 04:32:53,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:53,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19822816] [2023-05-04 04:32:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:53,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:53,883 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 04:32:53,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19822816] [2023-05-04 04:32:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19822816] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:53,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:53,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 04:32:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795342622] [2023-05-04 04:32:53,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:53,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 04:32:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 04:32:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 04:32:53,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:53,885 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:53,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 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 04:32:53,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:53,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 04:32:53,893 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 04:32:53,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 04:32:53,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 04:32:53,895 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 04:32:53,895 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 04:32:53,899 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:32:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 04:32:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:53,901 INFO L229 MonitoredProcess]: Starting monitored process 4 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 04:32:53,906 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 04:32:53,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 04:32:53,908 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;@22e0e20c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 04:32:53,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 04:32:53,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-05-04 04:32:54,014 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:54,015 INFO L85 PathProgramCache]: Analyzing trace with hash 623107423, now seen corresponding path program 1 times [2023-05-04 04:32:54,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:54,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215035991] [2023-05-04 04:32:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:54,389 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 04:32:54,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:54,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215035991] [2023-05-04 04:32:54,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215035991] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:54,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:54,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 04:32:54,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408148498] [2023-05-04 04:32:54,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:54,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 04:32:54,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 04:32:54,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 04:32:54,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:54,392 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:54,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 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 04:32:54,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:54,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:54,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 04:32:54,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash 175723025, now seen corresponding path program 1 times [2023-05-04 04:32:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:54,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664915018] [2023-05-04 04:32:54,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:54,735 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 04:32:54,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:54,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664915018] [2023-05-04 04:32:54,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664915018] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:32:54,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:32:54,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:32:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274501200] [2023-05-04 04:32:54,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:32:54,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:32:54,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:32:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:32:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:54,737 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:54,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 04:32:54,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:54,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:54,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 04:32:54,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:54,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1360987719, now seen corresponding path program 1 times [2023-05-04 04:32:54,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:54,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10416643] [2023-05-04 04:32:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:54,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10416643] [2023-05-04 04:32:54,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10416643] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:32:54,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956224295] [2023-05-04 04:32:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:54,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:32:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:54,978 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 04:32:54,983 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 04:32:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:55,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 04:32:55,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:32:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:55,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:32:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:55,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956224295] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:32:55,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:32:55,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 04:32:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079136754] [2023-05-04 04:32:55,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:32:55,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 04:32:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 04:32:55,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 04:32:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:55,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:55,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 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 04:32:55,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:55,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:55,446 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:55,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:32:55,541 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 04:32:55,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:32:55,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:55,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash -781158759, now seen corresponding path program 2 times [2023-05-04 04:32:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:55,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209664097] [2023-05-04 04:32:55,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:56,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209664097] [2023-05-04 04:32:56,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209664097] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:32:56,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975567806] [2023-05-04 04:32:56,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:32:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:32:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:56,068 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 04:32:56,117 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 04:32:56,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 04:32:56,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:32:56,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 04:32:56,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:32:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:56,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:32:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:56,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975567806] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:32:56,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:32:56,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-04 04:32:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691611264] [2023-05-04 04:32:56,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:32:56,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 04:32:56,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:32:56,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 04:32:56,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-04 04:32:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:56,740 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:32:56,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 27.944444444444443) internal successors, (503), 18 states have internal predecessors, (503), 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 04:32:56,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:56,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:56,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:32:56,741 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:32:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:32:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:32:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:32:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:32:56,955 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 04:32:57,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-04 04:32:57,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:32:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:32:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash 184827993, now seen corresponding path program 3 times [2023-05-04 04:32:57,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:32:57,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466783555] [2023-05-04 04:32:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:32:57,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:32:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:32:57,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 161 proven. 1022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 04:32:57,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:32:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466783555] [2023-05-04 04:32:57,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466783555] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:32:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725702384] [2023-05-04 04:32:57,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-04 04:32:57,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:32:57,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:32:57,906 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 04:32:57,913 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 04:32:58,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-04 04:32:58,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:32:58,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 38 conjunts are in the unsatisfiable core [2023-05-04 04:32:58,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:32:59,415 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 04:32:59,748 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 04:32:59,769 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 15 treesize of output 7 [2023-05-04 04:32:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 336 proven. 131 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-05-04 04:32:59,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:32:59,943 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 18 treesize of output 12 [2023-05-04 04:33:00,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 448 proven. 19 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-05-04 04:33:00,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725702384] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:33:00,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:33:00,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 8] total 32 [2023-05-04 04:33:00,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956176578] [2023-05-04 04:33:00,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:33:00,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-04 04:33:00,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:33:00,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-04 04:33:00,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2023-05-04 04:33:00,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:00,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:33:00,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 26.09375) internal successors, (835), 32 states have internal predecessors, (835), 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 04:33:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:02,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:02,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:02,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-05-04 04:33:02,847 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 04:33:03,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:33:03,042 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:33:03,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:33:03,043 INFO L85 PathProgramCache]: Analyzing trace with hash 311879572, now seen corresponding path program 1 times [2023-05-04 04:33:03,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:33:03,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726198475] [2023-05-04 04:33:03,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:33:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:33:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:33:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2750 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2023-05-04 04:33:03,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:33:03,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726198475] [2023-05-04 04:33:03,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726198475] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:33:03,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:33:03,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:33:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312261604] [2023-05-04 04:33:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:33:03,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:33:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:33:03,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:33:03,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:33:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:03,489 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:33:03,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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 04:33:03,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:03,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:03,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:03,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:03,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-05-04 04:33:03,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-05-04 04:33:04,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:04,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 04:33:04,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:33:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:33:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1640010320, now seen corresponding path program 1 times [2023-05-04 04:33:04,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:33:04,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264570941] [2023-05-04 04:33:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:33:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:33:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:33:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2023-05-04 04:33:04,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:33:04,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264570941] [2023-05-04 04:33:04,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264570941] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 04:33:04,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 04:33:04,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 04:33:04,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701635341] [2023-05-04 04:33:04,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 04:33:04,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 04:33:04,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:33:04,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 04:33:04,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 04:33:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:04,498 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:33:04,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 04:33:04,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:04,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:04,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:04,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:04,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2023-05-04 04:33:04,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:04,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:33:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:05,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:05,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-04 04:33:05,778 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:33:05,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:33:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1086958796, now seen corresponding path program 1 times [2023-05-04 04:33:05,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:33:05,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077183557] [2023-05-04 04:33:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:33:05,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:33:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:33:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1176 proven. 141 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2023-05-04 04:33:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:33:14,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077183557] [2023-05-04 04:33:14,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077183557] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:33:14,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204369791] [2023-05-04 04:33:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:33:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:33:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:33:14,167 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 04:33:14,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 04:33:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:33:14,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 61 conjunts are in the unsatisfiable core [2023-05-04 04:33:14,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:33:17,141 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 04:33:17,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:17,503 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-05-04 04:33:17,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 48 [2023-05-04 04:33:17,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:17,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:17,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2023-05-04 04:33:17,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-05-04 04:33:17,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:17,999 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 04:33:18,184 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 04:33:18,201 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 15 treesize of output 7 [2023-05-04 04:33:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1767 proven. 147 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2023-05-04 04:33:18,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:33:19,478 INFO L356 Elim1Store]: treesize reduction 233, result has 45.2 percent of original size [2023-05-04 04:33:19,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 210 treesize of output 361 [2023-05-04 04:33:19,523 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-05-04 04:33:19,523 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 218 treesize of output 212 [2023-05-04 04:33:19,557 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-05-04 04:33:19,558 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 270 treesize of output 257 [2023-05-04 04:33:19,571 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 74 treesize of output 66 [2023-05-04 04:33:19,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:33:19,598 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 88 treesize of output 84 [2023-05-04 04:33:19,670 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 8 treesize of output 4 [2023-05-04 04:33:19,683 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 8 treesize of output 4 [2023-05-04 04:33:19,738 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 8 treesize of output 4 [2023-05-04 04:33:19,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:33:19,754 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 73 treesize of output 71 [2023-05-04 04:33:19,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:33:19,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 134 treesize of output 184 [2023-05-04 04:33:20,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:33:20,628 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 72 treesize of output 72 [2023-05-04 04:33:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1567 proven. 320 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2023-05-04 04:33:21,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204369791] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:33:21,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:33:21,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 57 [2023-05-04 04:33:21,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330150476] [2023-05-04 04:33:21,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:33:21,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-05-04 04:33:21,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:33:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-05-04 04:33:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2712, Unknown=41, NotChecked=0, Total=3192 [2023-05-04 04:33:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:21,402 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:33:21,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 18.087719298245613) internal successors, (1031), 57 states have internal predecessors, (1031), 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 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:21,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:23,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:33:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:23,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 04:33:23,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:33:23,306 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:33:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:33:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1968058577, now seen corresponding path program 1 times [2023-05-04 04:33:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:33:23,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543030407] [2023-05-04 04:33:23,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:33:23,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:33:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:33:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-04 04:33:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:33:39,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543030407] [2023-05-04 04:33:39,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543030407] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:33:39,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016002314] [2023-05-04 04:33:39,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:33:39,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:33:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:33:39,073 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 04:33:39,077 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 04:33:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:33:39,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 101 conjunts are in the unsatisfiable core [2023-05-04 04:33:39,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:33:39,751 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 04:33:39,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 04:33:39,809 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 04:33:39,809 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 04:33:40,007 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 04:33:40,066 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 04:33:40,635 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 31 treesize of output 29 [2023-05-04 04:33:40,783 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 31 treesize of output 29 [2023-05-04 04:33:41,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:41,175 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:33:41,194 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 04:33:41,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2023-05-04 04:33:41,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:41,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:41,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-05-04 04:33:41,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-05-04 04:33:41,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:41,701 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 25 treesize of output 25 [2023-05-04 04:33:42,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:42,301 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:33:42,318 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 04:33:42,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2023-05-04 04:33:42,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:42,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:42,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-05-04 04:33:42,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-04 04:33:42,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:42,580 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 04:33:42,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:33:42,831 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 04:33:42,852 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 19 treesize of output 7 [2023-05-04 04:33:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-04 04:33:42,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:33:43,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2038 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2023-05-04 04:33:44,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= v_ArrVal_2030 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))))) is different from false [2023-05-04 04:33:44,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))) is different from false [2023-05-04 04:33:44,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2030)))))) is different from false [2023-05-04 04:33:44,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse1 .cse2)))))))) is different from false [2023-05-04 04:33:44,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2025)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2030)))))) is different from false [2023-05-04 04:33:44,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse0 .cse1))) (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2025))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse4 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse3 .cse4))))))))))) is different from false [2023-05-04 04:33:44,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse4 .cse1))) (not (= (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse3 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))) is different from false [2023-05-04 04:33:51,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2024))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse3 .cse1))) (not (= (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) .cse5 v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))))))))) is different from false [2023-05-04 04:33:51,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int) (v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (v_ArrVal_2036 Int) (v_ArrVal_2027 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2024))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse3 .cse1))) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) .cse5 v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))))) is different from false [2023-05-04 04:33:52,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int) (v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2022 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (v_ArrVal_2036 Int) (v_ArrVal_2027 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_2022)))) (let ((.cse9 (store (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2024))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_2027) .cse2 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (< (+ 1 (select .cse4 .cse2)) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse5 .cse2))) (not (= (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) .cse7 v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse8 .cse2))))))))))) is different from false [2023-05-04 04:33:52,683 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-04 04:33:52,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1163 treesize of output 1031 [2023-05-04 04:33:52,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:33:52,737 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 1542 treesize of output 1510 [2023-05-04 04:33:52,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 794 treesize of output 762 [2023-05-04 04:33:52,782 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 598 treesize of output 566 [2023-05-04 04:33:52,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 729 treesize of output 697 [2023-05-04 04:33:52,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 745 treesize of output 733 [2023-05-04 04:33:53,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2023-05-04 04:33:53,602 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:33:53,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 272 treesize of output 258 [2023-05-04 04:33:55,044 INFO L356 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2023-05-04 04:33:55,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 131 [2023-05-04 04:33:55,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-04 04:33:55,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016002314] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:33:55,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:33:55,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 37] total 100 [2023-05-04 04:33:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266327939] [2023-05-04 04:33:55,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:33:55,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2023-05-04 04:33:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:33:55,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2023-05-04 04:33:55,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=7105, Unknown=41, NotChecked=2024, Total=9900 [2023-05-04 04:33:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:33:55,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:33:55,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 6.6) internal successors, (660), 100 states have internal predecessors, (660), 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 04:33:55,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:33:55,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:34:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:34:02,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 04:34:02,275 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 04:34:02,461 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,SelfDestructingSolverStorable16 [2023-05-04 04:34:02,461 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:34:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:34:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash 11641223, now seen corresponding path program 2 times [2023-05-04 04:34:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:34:02,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263184094] [2023-05-04 04:34:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:34:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:34:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 04:34:35,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 1986 proven. 967 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2023-05-04 04:34:35,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 04:34:35,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263184094] [2023-05-04 04:34:35,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263184094] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 04:34:35,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134203887] [2023-05-04 04:34:35,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 04:34:35,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 04:34:35,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 04:34:35,505 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 04:34:35,507 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 04:34:36,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 04:34:36,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 04:34:36,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 125 conjunts are in the unsatisfiable core [2023-05-04 04:34:36,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 04:34:39,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 16 [2023-05-04 04:34:39,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:39,563 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 17 treesize of output 19 [2023-05-04 04:34:39,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:39,872 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 24 treesize of output 23 [2023-05-04 04:34:40,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-05-04 04:34:40,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:40,595 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:34:40,612 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:34:40,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-05-04 04:34:40,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:40,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:40,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-05-04 04:34:41,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2023-05-04 04:34:41,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:41,381 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 36 treesize of output 34 [2023-05-04 04:34:41,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:41,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:41,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-05-04 04:34:42,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2023-05-04 04:34:43,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:43,114 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 04:34:43,131 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-04 04:34:43,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2023-05-04 04:34:43,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:43,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:43,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-05-04 04:34:43,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 34 [2023-05-04 04:34:43,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 04:34:43,945 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 04:34:44,158 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 04:34:44,169 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 15 treesize of output 7 [2023-05-04 04:34:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 1457 proven. 288 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2023-05-04 04:34:44,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 04:34:44,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2529 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) is different from false [2023-05-04 04:35:27,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse0 .cse4 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse5))) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2525) .cse5 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= 800 (select .cse3 .cse5))))))) is different from false [2023-05-04 04:35:27,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store (store .cse0 .cse5 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (= 800 (select .cse2 .cse3)) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800)))))) is different from false [2023-05-04 04:35:27,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse0 .cse4 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* 4 (select .cse0 .cse5)) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2525) .cse5 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= 800 (select .cse3 .cse5))))))) is different from false [2023-05-04 04:35:27,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store (store .cse5 .cse2 v_ArrVal_2519) .cse4 v_ArrVal_2521) (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse4) 800) (= (select .cse1 .cse3) 800) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_2521)))))) is different from false [2023-05-04 04:35:30,001 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store (store .cse5 .cse2 v_ArrVal_2519) .cse4 v_ArrVal_2521) (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse4) 800) (= (select .cse1 .cse3) 800) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_2521)))))) (= 800 .cse8)))) is different from false [2023-05-04 04:35:30,064 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse0 .cse4 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2525) .cse5 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= (select .cse3 .cse5) 800)))))) (= 800 .cse8)))) is different from false [2023-05-04 04:35:30,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2512)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse7 .cse8))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse8 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store (store .cse0 .cse6 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (= 800 (select .cse2 .cse3)) (= .cse4 800) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800)))))))) is different from false [2023-05-04 04:35:30,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse9 .cse8) 4)) v_ArrVal_2512)))) (let ((.cse4 (select .cse7 .cse8))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse8 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store (store .cse2 .cse6 v_ArrVal_2519) .cse3 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2524))) (or (= 800 (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2521) (= .cse4 800) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse3) 800))))))))) is different from false [2023-05-04 04:35:30,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse9 .cse8))) v_ArrVal_2512)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2514) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store (store .cse6 .cse2 v_ArrVal_2519) .cse4 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse3))) v_ArrVal_2524))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse4) 800) (= 800 (select .cse1 .cse3)) (= 800 .cse5) (< (+ (select .cse6 .cse4) 1) v_ArrVal_2521))))))))) is different from false [2023-05-04 04:36:12,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2508 Int) (v_ArrVal_2519 Int) (v_ArrVal_2510 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2507 (Array Int Int)) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2507))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse8 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store (store .cse0 .cse5 v_ArrVal_2508) .cse1 v_ArrVal_2510) (+ (* (select .cse0 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2512))) (let ((.cse7 (select .cse9 .cse6))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2514) .cse6 (+ 1 .cse7))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse2 .cse5 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse2 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (not (= 800 (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2525) .cse6 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= 800 (select .cse4 .cse6)) (not (<= v_ArrVal_2510 1)) (= 800 .cse7)))))))))) is different from false [2023-05-04 04:36:12,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2508 Int) (v_ArrVal_2519 Int) (v_ArrVal_2510 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2507 (Array Int Int)) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2507))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store (store .cse5 .cse7 v_ArrVal_2508) .cse1 v_ArrVal_2510) (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2512))) (let ((.cse4 (select .cse9 .cse3))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse7 v_ArrVal_2514) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse0 .cse7 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (= 800 (select .cse2 .cse3)) (not (<= v_ArrVal_2510 1)) (= 800 .cse4) (not (= 800 (select .cse5 .cse1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800)))))))))) is different from false [2023-05-04 04:36:12,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2508 Int) (v_ArrVal_2519 Int) (v_ArrVal_2510 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2507 (Array Int Int)) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse10 .cse11 (+ (select .cse10 .cse11) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2507))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse8 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store (store .cse0 .cse4 v_ArrVal_2508) .cse1 v_ArrVal_2510) (+ |c_~#queue~0.offset| (* (select .cse0 .cse5) 4)) v_ArrVal_2512))) (let ((.cse7 (select .cse9 .cse5))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2514) .cse5 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse6 .cse4 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (not (= 800 (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2525) .cse5 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2521) (not (<= v_ArrVal_2510 1)) (= 800 (select .cse3 .cse5)) (= 800 .cse7)))))))))) is different from false [2023-05-04 04:36:23,268 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:36:23,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 1270 treesize of output 682 [2023-05-04 04:36:23,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:36:23,288 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 912 treesize of output 884 [2023-05-04 04:36:23,298 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 370 treesize of output 354 [2023-05-04 04:36:23,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 770 treesize of output 722 [2023-05-04 04:36:23,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 317 [2023-05-04 04:36:23,350 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 04:36:23,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 04:36:23,411 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 326 treesize of output 266 [2023-05-04 04:36:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 125 proven. 965 refuted. 243 times theorem prover too weak. 1877 trivial. 321 not checked. [2023-05-04 04:36:38,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134203887] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 04:36:38,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 04:36:38,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 43, 45] total 154 [2023-05-04 04:36:38,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687939760] [2023-05-04 04:36:38,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 04:36:38,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 154 states [2023-05-04 04:36:38,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 04:36:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2023-05-04 04:36:38,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1896, Invalid=17732, Unknown=164, NotChecked=3770, Total=23562 [2023-05-04 04:36:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:36:38,490 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 04:36:38,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 154 states, 154 states have (on average 9.253246753246753) internal successors, (1425), 154 states have internal predecessors, (1425), 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 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-04 04:36:38,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 04:37:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-04 04:37:07,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2023-05-04 04:37:07,378 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 04:37:07,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-04 04:37:07,561 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 04:37:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 04:37:07,561 INFO L85 PathProgramCache]: Analyzing trace with hash 404558085, now seen corresponding path program 3 times [2023-05-04 04:37:07,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 04:37:07,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380680339] [2023-05-04 04:37:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 04:37:07,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 04:37:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-05-04 04:45:15,782 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 04:45:15,782 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 04:45:15,782 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 04:45:15,782 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 04:45:16,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-05-04 04:45:16,229 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-04 04:45:16,233 INFO L158 Benchmark]: Toolchain (without parser) took 767838.82ms. Allocated memory was 188.7MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 125.1MB in the beginning and 820.3MB in the end (delta: -695.2MB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2023-05-04 04:45:16,233 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 188.7MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 04:45:16,233 INFO L158 Benchmark]: CACSL2BoogieTranslator took 665.86ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 124.8MB in the beginning and 180.6MB in the end (delta: -55.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-05-04 04:45:16,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.44ms. Allocated memory is still 232.8MB. Free memory was 180.6MB in the beginning and 177.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 04:45:16,233 INFO L158 Benchmark]: Boogie Preprocessor took 64.73ms. Allocated memory is still 232.8MB. Free memory was 177.5MB in the beginning and 175.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 04:45:16,234 INFO L158 Benchmark]: RCFGBuilder took 596.46ms. Allocated memory is still 232.8MB. Free memory was 175.4MB in the beginning and 152.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-04 04:45:16,234 INFO L158 Benchmark]: TraceAbstraction took 766420.05ms. Allocated memory was 232.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 151.3MB in the beginning and 820.3MB in the end (delta: -669.0MB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2023-05-04 04:45:16,235 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.12ms. Allocated memory is still 188.7MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 665.86ms. Allocated memory was 188.7MB in the beginning and 232.8MB in the end (delta: 44.0MB). Free memory was 124.8MB in the beginning and 180.6MB in the end (delta: -55.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 86.44ms. Allocated memory is still 232.8MB. Free memory was 180.6MB in the beginning and 177.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.73ms. Allocated memory is still 232.8MB. Free memory was 177.5MB in the beginning and 175.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 596.46ms. Allocated memory is still 232.8MB. Free memory was 175.4MB in the beginning and 152.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 766420.05ms. Allocated memory was 232.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 151.3MB in the beginning and 820.3MB in the end (delta: -669.0MB). Peak memory consumption was 3.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: 31239, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 1216, dependent conditional: 1142, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 531, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11543, independent: 11457, independent conditional: 14, independent unconditional: 11443, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11543, independent: 11439, independent conditional: 0, independent unconditional: 11439, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 334, independent: 111, independent conditional: 37, independent unconditional: 73, dependent: 223, dependent conditional: 35, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30862, independent: 18566, independent conditional: 110, independent unconditional: 18456, dependent: 753, dependent conditional: 135, dependent unconditional: 618, unknown: 11543, unknown conditional: 26, unknown unconditional: 11517] , Statistics on independence cache: Total cache size (in pairs): 11543, Positive cache size: 11457, Positive conditional cache size: 14, Positive unconditional cache size: 11443, Negative cache size: 86, Negative conditional cache size: 12, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 384, Maximal queried relation: 6, Independence queries for same thread: 1032 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 2799, Number of trivial persistent sets: 2645, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12896, independent: 12822, independent conditional: 0, independent unconditional: 12822, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31239, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 1216, dependent conditional: 1142, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 531, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11543, independent: 11457, independent conditional: 14, independent unconditional: 11443, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11543, independent: 11439, independent conditional: 0, independent unconditional: 11439, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 334, independent: 111, independent conditional: 37, independent unconditional: 73, dependent: 223, dependent conditional: 35, dependent unconditional: 189, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30862, independent: 18566, independent conditional: 110, independent unconditional: 18456, dependent: 753, dependent conditional: 135, dependent unconditional: 618, unknown: 11543, unknown conditional: 26, unknown unconditional: 11517] , Statistics on independence cache: Total cache size (in pairs): 11543, Positive cache size: 11457, Positive conditional cache size: 14, Positive unconditional cache size: 11443, Negative cache size: 86, Negative conditional cache size: 12, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 384, Maximal queried relation: 6, Independence queries for same thread: 1032 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8602, independent: 8415, independent conditional: 237, independent unconditional: 8178, dependent: 187, dependent conditional: 112, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8530, independent: 8415, independent conditional: 237, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8530, independent: 8415, independent conditional: 237, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8550, independent: 8415, independent conditional: 0, independent unconditional: 8415, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8550, independent: 8415, independent conditional: 0, independent unconditional: 8415, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8550, independent: 8415, independent conditional: 0, independent unconditional: 8415, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8550, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 72 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 241, Number of trivial persistent sets: 210, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8253, independent: 8178, independent conditional: 0, independent unconditional: 8178, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8602, independent: 8415, independent conditional: 237, independent unconditional: 8178, dependent: 187, dependent conditional: 112, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8530, independent: 8415, independent conditional: 237, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8530, independent: 8415, independent conditional: 237, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8550, independent: 8415, independent conditional: 0, independent unconditional: 8415, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8550, independent: 8415, independent conditional: 0, independent unconditional: 8415, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8550, independent: 8415, independent conditional: 0, independent unconditional: 8415, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8550, independent: 375, independent conditional: 0, independent unconditional: 375, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 72 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown