/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 X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 19:19:36,999 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 19:19:37,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 19:19:37,022 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 19:19:37,022 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 19:19:37,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 19:19:37,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 19:19:37,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 19:19:37,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 19:19:37,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 19:19:37,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 19:19:37,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 19:19:37,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 19:19:37,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 19:19:37,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 19:19:37,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 19:19:37,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 19:19:37,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 19:19:37,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 19:19:37,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 19:19:37,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 19:19:37,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 19:19:37,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 19:19:37,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 19:19:37,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 19:19:37,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 19:19:37,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 19:19:37,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 19:19:37,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 19:19:37,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 19:19:37,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 19:19:37,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 19:19:37,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 19:19:37,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 19:19:37,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 19:19:37,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 19:19:37,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 19:19:37,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 19:19:37,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 19:19:37,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 19:19:37,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 19:19:37,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 19:19:37,084 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 19:19:37,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 19:19:37,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 19:19:37,085 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 19:19:37,085 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 19:19:37,085 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 19:19:37,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 19:19:37,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 19:19:37,086 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 19:19:37,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:19:37,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 19:19:37,087 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 19:19:37,088 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 19:19:37,088 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 -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 19:19:37,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 19:19:37,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 19:19:37,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 19:19:37,314 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 19:19:37,315 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 19:19:37,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2023-05-04 19:19:37,373 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a687313/1dde38216f754530988f6b52f9b51cf4/FLAG8759f1b71 [2023-05-04 19:19:37,920 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 19:19:37,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2023-05-04 19:19:37,939 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a687313/1dde38216f754530988f6b52f9b51cf4/FLAG8759f1b71 [2023-05-04 19:19:38,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a687313/1dde38216f754530988f6b52f9b51cf4 [2023-05-04 19:19:38,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 19:19:38,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 19:19:38,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 19:19:38,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 19:19:38,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 19:19:38,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:19:38" (1/1) ... [2023-05-04 19:19:38,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f9de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:38, skipping insertion in model container [2023-05-04 19:19:38,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:19:38" (1/1) ... [2023-05-04 19:19:38,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 19:19:38,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 19:19:38,880 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.i[43284,43297] [2023-05-04 19:19:38,883 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.i[43491,43504] [2023-05-04 19:19:38,885 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.i[43772,43785] [2023-05-04 19:19:38,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:19:38,902 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 19:19:38,961 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.i[43284,43297] [2023-05-04 19:19:38,963 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.i[43491,43504] [2023-05-04 19:19:38,965 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.i[43772,43785] [2023-05-04 19:19:38,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 19:19:39,010 INFO L208 MainTranslator]: Completed translation [2023-05-04 19:19:39,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39 WrapperNode [2023-05-04 19:19:39,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 19:19:39,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 19:19:39,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 19:19:39,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 19:19:39,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,056 INFO L138 Inliner]: procedures = 274, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2023-05-04 19:19:39,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 19:19:39,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 19:19:39,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 19:19:39,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 19:19:39,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,092 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 19:19:39,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 19:19:39,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 19:19:39,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 19:19:39,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (1/1) ... [2023-05-04 19:19:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 19:19:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:19:39,162 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 19:19:39,179 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 19:19:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 19:19:39,189 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 19:19:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 19:19:39,189 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 19:19:39,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 19:19:39,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 19:19:39,191 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 19:19:39,344 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 19:19:39,346 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 19:19:39,635 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 19:19:39,643 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 19:19:39,643 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 19:19:39,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:19:39 BoogieIcfgContainer [2023-05-04 19:19:39,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 19:19:39,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 19:19:39,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 19:19:39,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 19:19:39,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 07:19:38" (1/3) ... [2023-05-04 19:19:39,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b37ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:19:39, skipping insertion in model container [2023-05-04 19:19:39,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:19:39" (2/3) ... [2023-05-04 19:19:39,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b37ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:19:39, skipping insertion in model container [2023-05-04 19:19:39,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:19:39" (3/3) ... [2023-05-04 19:19:39,651 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2023-05-04 19:19:39,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 19:19:39,663 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 19:19:39,663 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 19:19:39,663 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 19:19:39,787 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 19:19:39,847 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:19:39,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:19:39,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:19:39,882 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 19:19:39,923 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 19:19:39,962 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:19:39,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 19:19:39,998 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;@2483b7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:19:39,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 19:19:40,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:40,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash -787926323, now seen corresponding path program 1 times [2023-05-04 19:19:40,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:40,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667179154] [2023-05-04 19:19:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:40,621 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 19:19:40,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:40,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667179154] [2023-05-04 19:19:40,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667179154] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:40,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:40,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 19:19:40,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081750238] [2023-05-04 19:19:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:40,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 19:19:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 19:19:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 19:19:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:40,649 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:40,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 19:19:40,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:40,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:40,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 19:19:40,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1809857133, now seen corresponding path program 1 times [2023-05-04 19:19:40,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:40,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265917975] [2023-05-04 19:19:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:43,461 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 19:19:43,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:43,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265917975] [2023-05-04 19:19:43,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265917975] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:43,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:43,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 19:19:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335743716] [2023-05-04 19:19:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:43,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 19:19:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:43,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 19:19:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2023-05-04 19:19:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:43,465 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:43,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.655172413793103) internal successors, (135), 29 states have internal predecessors, (135), 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 19:19:43,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:43,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:45,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:19:45,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 19:19:45,487 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1147441762, now seen corresponding path program 1 times [2023-05-04 19:19:45,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:45,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374401124] [2023-05-04 19:19:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:45,658 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 19:19:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:45,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374401124] [2023-05-04 19:19:45,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374401124] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:45,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:45,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 19:19:45,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445576986] [2023-05-04 19:19:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:45,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 19:19:45,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:45,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 19:19:45,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 19:19:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:45,669 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:45,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 19:19:45,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:45,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:19:45,669 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:19:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:45,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 19:19:45,693 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash 234964704, now seen corresponding path program 1 times [2023-05-04 19:19:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:45,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921179327] [2023-05-04 19:19:45,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:45,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:45,744 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 19:19:45,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:45,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921179327] [2023-05-04 19:19:45,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921179327] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:45,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:45,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 19:19:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352370860] [2023-05-04 19:19:45,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:45,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 19:19:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 19:19:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 19:19:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:45,746 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:45,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 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 19:19:45,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:45,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:19:45,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:45,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:19:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:45,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 19:19:45,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:45,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:45,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2111334944, now seen corresponding path program 1 times [2023-05-04 19:19:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:45,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125323096] [2023-05-04 19:19:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:45,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:46,021 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 19:19:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125323096] [2023-05-04 19:19:46,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125323096] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:46,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:46,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 19:19:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954694918] [2023-05-04 19:19:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:46,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 19:19:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:46,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 19:19:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 19:19:46,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:46,024 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:46,025 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 19:19:46,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:46,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 19:19:46,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:46,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:46,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 19:19:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:46,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 19:19:46,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:46,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2010469613, now seen corresponding path program 2 times [2023-05-04 19:19:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:46,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195582564] [2023-05-04 19:19:46,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:46,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:51,784 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 19:19:51,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:51,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195582564] [2023-05-04 19:19:51,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195582564] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:51,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:51,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-05-04 19:19:51,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515178897] [2023-05-04 19:19:51,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:51,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-05-04 19:19:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:51,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-05-04 19:19:51,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2023-05-04 19:19:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:51,787 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.0) internal successors, (135), 27 states have internal predecessors, (135), 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 19:19:51,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:51,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 19:19:51,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:51,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:51,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:51,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 19:19:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 19:19:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:54,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 19:19:54,602 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 19:19:54,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 19:19:54,611 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2023-05-04 19:19:54,612 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 19:19:54,618 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:19:54,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:19:54,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:19:54,628 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 19:19:54,628 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 19:19:54,677 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:19:54,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 19:19:54,678 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;@2483b7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:19:54,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 19:19:54,681 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 19:19:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1938744424, now seen corresponding path program 1 times [2023-05-04 19:19:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:54,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034961931] [2023-05-04 19:19:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:54,698 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 19:19:54,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:54,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034961931] [2023-05-04 19:19:54,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034961931] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:54,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:54,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 19:19:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757214229] [2023-05-04 19:19:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:54,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 19:19:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:54,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 19:19:54,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 19:19:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:54,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:54,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 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 19:19:54,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:54,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 19:19:54,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 19:19:54,868 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 19:19:54,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 19:19:54,871 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 19:19:54,871 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 19:19:54,873 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:19:54,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 19:19:54,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:19:54,875 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 19:19:54,876 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 19:19:54,878 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 19:19:54,879 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 19:19:54,880 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;@2483b7b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 19:19:54,880 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 19:19:55,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:55,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash -592959386, now seen corresponding path program 1 times [2023-05-04 19:19:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:55,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062430373] [2023-05-04 19:19:55,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:55,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:19:55,094 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 19:19:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:19:55,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062430373] [2023-05-04 19:19:55,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062430373] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:19:55,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:19:55,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 19:19:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786956356] [2023-05-04 19:19:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:19:55,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 19:19:55,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:19:55,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 19:19:55,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 19:19:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:55,096 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:19:55,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 19:19:55,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:19:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:19:55,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 19:19:55,120 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:19:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:19:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2098280855, now seen corresponding path program 1 times [2023-05-04 19:19:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:19:55,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252002793] [2023-05-04 19:19:55,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:19:55,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:19:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:20:01,246 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 19:20:01,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:20:01,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252002793] [2023-05-04 19:20:01,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252002793] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:20:01,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:20:01,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2023-05-04 19:20:01,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997268255] [2023-05-04 19:20:01,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:20:01,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-05-04 19:20:01,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:20:01,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-05-04 19:20:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1672, Unknown=0, NotChecked=0, Total=1892 [2023-05-04 19:20:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:20:01,249 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:20:01,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.818181818181818) internal successors, (212), 44 states have internal predecessors, (212), 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 19:20:01,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:20:01,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:20:05,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:20:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 19:20:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 19:20:05,530 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:20:05,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:20:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash 354845292, now seen corresponding path program 1 times [2023-05-04 19:20:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:20:05,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751893326] [2023-05-04 19:20:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:20:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:20:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:20:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-05-04 19:20:10,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:20:10,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751893326] [2023-05-04 19:20:10,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751893326] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:20:10,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:20:10,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2023-05-04 19:20:10,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478011243] [2023-05-04 19:20:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:20:10,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-05-04 19:20:10,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:20:10,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-05-04 19:20:10,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2023-05-04 19:20:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:20:10,703 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:20:10,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.352941176470589) internal successors, (284), 34 states have internal predecessors, (284), 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 19:20:10,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:20:10,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 19:20:10,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:20:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:20:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 19:20:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 19:20:12,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 19:20:12,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:20:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:20:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash -300259292, now seen corresponding path program 1 times [2023-05-04 19:20:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:20:12,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336408160] [2023-05-04 19:20:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:20:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:20:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:21:17,385 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 19:21:17,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:21:17,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336408160] [2023-05-04 19:21:17,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336408160] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 19:21:17,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 19:21:17,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2023-05-04 19:21:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510466260] [2023-05-04 19:21:17,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 19:21:17,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-05-04 19:21:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:21:17,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-05-04 19:21:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2262, Unknown=0, NotChecked=0, Total=2450 [2023-05-04 19:21:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:21:17,400 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:21:17,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.32) internal successors, (216), 50 states have internal predecessors, (216), 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 19:21:17,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:21:17,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 19:21:17,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 19:21:17,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:21:39,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 19:21:49,776 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 130 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:21:56,551 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 135 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:22:05,084 WARN L233 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 143 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:22:13,376 WARN L233 SmtUtils]: Spent 6.48s on a formula simplification that was a NOOP. DAG size: 148 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:22:23,438 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 147 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:22:32,529 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:22:40,800 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:22:50,745 WARN L233 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 153 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:22:59,006 WARN L233 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 155 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:23:07,923 WARN L233 SmtUtils]: Spent 6.89s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:23:16,248 WARN L233 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:23:24,303 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 146 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:23:32,488 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:23:42,130 WARN L233 SmtUtils]: Spent 6.33s on a formula simplification that was a NOOP. DAG size: 151 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:23:44,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 19:23:48,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-05-04 19:23:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:23:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-05-04 19:23:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 19:23:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-05-04 19:23:51,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 19:23:51,481 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 19:23:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 19:23:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1703400623, now seen corresponding path program 1 times [2023-05-04 19:23:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 19:23:51,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474771777] [2023-05-04 19:23:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:23:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 19:23:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:23:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:23:57,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 19:23:57,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474771777] [2023-05-04 19:23:57,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474771777] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 19:23:57,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27193458] [2023-05-04 19:23:57,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 19:23:57,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:23:57,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 19:23:57,924 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 19:23:57,925 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 19:23:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 19:23:58,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 144 conjunts are in the unsatisfiable core [2023-05-04 19:23:58,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 19:23:58,239 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 19:23:58,240 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 19:23:58,298 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-04 19:23:58,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 19:23:58,489 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 19:23:58,547 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 19:23:59,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 19:23:59,128 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 19:23:59,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:23:59,533 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 19:23:59,533 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 19:23:59,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:23:59,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:23:59,585 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 19:23:59,801 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 46 treesize of output 27 [2023-05-04 19:23:59,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:23:59,930 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 33 treesize of output 31 [2023-05-04 19:24:00,592 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:24:00,605 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 19:24:00,606 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 51 treesize of output 41 [2023-05-04 19:24:00,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:00,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:00,671 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 40 treesize of output 36 [2023-05-04 19:24:00,894 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 48 treesize of output 29 [2023-05-04 19:24:01,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:01,020 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 33 treesize of output 31 [2023-05-04 19:24:01,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:01,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:01,392 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 40 treesize of output 36 [2023-05-04 19:24:01,676 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 19:24:02,016 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 19:24:02,026 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 19:24:02,027 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 51 treesize of output 41 [2023-05-04 19:24:02,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:02,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:02,065 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 40 treesize of output 36 [2023-05-04 19:24:02,202 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 40 treesize of output 27 [2023-05-04 19:24:02,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 19:24:02,264 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 19:24:02,425 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 19:24:02,434 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 19:24:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 19:24:02,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 19:24:02,592 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) is different from false [2023-05-04 19:25:37,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_560 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_557 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (let ((.cse2 (store (store (store .cse0 .cse5 v_ArrVal_553) .cse1 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_554) (= (select .cse2 .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse3))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_559) .cse3 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2023-05-04 19:25:37,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_560 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_557 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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (store (store (store .cse5 .cse3 v_ArrVal_553) .cse4 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (= (select .cse0 .cse1) 20) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_559) .cse1 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse4) 20) (< (+ (select .cse5 .cse4) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse1)))))))) is different from false [2023-05-04 19:25:37,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_560 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_557 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (let ((.cse3 (store (store (store .cse0 .cse4 v_ArrVal_553) .cse1 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_554) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_559) .cse5 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse5))) (= 20 (select .cse3 .cse5))))))) is different from false [2023-05-04 19:25:37,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_560 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_557 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_547) .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (let ((.cse3 (store (store (store .cse0 .cse5 v_ArrVal_553) .cse1 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse2))) (= 20 (select .cse3 .cse2)) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_559) .cse2 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse1) 20)))))) is different from false [2023-05-04 19:25:38,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_560 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_557 Int) (v_ArrVal_545 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (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_545)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_547) .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (store (store (store .cse2 .cse5 v_ArrVal_553) .cse3 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (= (select .cse0 .cse1) 20) (< (+ (select .cse2 .cse3) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_559) .cse1 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse3) 20)))))) is different from false [2023-05-04 19:25:38,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_554 Int) (v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (v_ArrVal_560 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_557 Int) (v_ArrVal_545 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_545))) (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_547) .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (store (store (store .cse2 .cse4 v_ArrVal_553) .cse5 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (= (select .cse0 .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_559) .cse1 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse5) 20) (< (+ (select .cse2 .cse5) 1) v_ArrVal_554)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse8 .cse7)))))) is different from false [2023-05-04 19:25:38,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_554 Int) (v_ArrVal_553 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_560 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_557 Int) (v_ArrVal_545 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_545))) (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_547) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse7 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 80))) (let ((.cse3 (store (store (store .cse7 .cse4 v_ArrVal_553) .cse6 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_559) .cse5 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse6) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse7 .cse5))) (< (+ (select .cse7 .cse6) 1) v_ArrVal_554) (= (select .cse3 .cse5) 20))))))) is different from false [2023-05-04 19:25:58,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_545 Int) (v_ArrVal_554 Int) (v_ArrVal_553 Int) (v_ArrVal_560 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_544))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_545))) (store (store .cse8 .cse6 v_ArrVal_547) .cse2 (+ (select .cse8 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 80))) (let ((.cse5 (store (store (store .cse0 .cse6 v_ArrVal_553) .cse1 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse3 .cse2))) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_559) .cse2 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse1) 20) (= (select .cse5 .cse2) 20)))))))) is different from false [2023-05-04 19:25:58,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_545 Int) (v_ArrVal_554 Int) (v_ArrVal_553 Int) (v_ArrVal_540 Int) (v_ArrVal_560 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_540) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_544))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_545))) (store (store .cse8 .cse2 v_ArrVal_547) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse1 (store (store (store .cse5 .cse2 v_ArrVal_553) .cse4 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_559) .cse3 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse4) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse3))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse6 .cse3))) (= 20 (select .cse1 .cse3))))))))) is different from false [2023-05-04 19:25:58,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_538 Int) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_545 Int) (v_ArrVal_554 Int) (v_ArrVal_553 Int) (v_ArrVal_540 Int) (v_ArrVal_560 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (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_538)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_540) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_544))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_545))) (store (store .cse8 .cse6 v_ArrVal_547) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse2 (store (store (store .cse3 .cse6 v_ArrVal_553) .cse4 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse0 .cse1))) (= (select .cse2 .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_554) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_559) .cse1 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse4) 20)))))))) is different from false [2023-05-04 19:25:58,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_538 Int) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_545 Int) (v_ArrVal_554 Int) (v_ArrVal_553 Int) (v_ArrVal_540 Int) (v_ArrVal_560 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_538))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_540) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_544))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_545))) (store (store .cse8 .cse2 v_ArrVal_547) .cse3 (+ (select .cse8 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse1 (store (store (store .cse5 .cse2 v_ArrVal_553) .cse4 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_559) .cse3 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse4) 20) (= 20 (select .cse1 .cse3)) (< (+ (select .cse5 .cse4) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse6 .cse3)))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse11 .cse10)))))) is different from false [2023-05-04 19:25:59,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_538 Int) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_545 Int) (v_ArrVal_554 Int) (v_ArrVal_553 Int) (v_ArrVal_540 Int) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_538))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_540) .cse8 (+ (select .cse11 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_544))) (let ((.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_545))) (store (store .cse10 .cse3 v_ArrVal_547) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (store (store (store .cse6 .cse3 v_ArrVal_553) .cse4 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557))) (or (= (select .cse0 .cse1) 20) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_559) .cse1 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse4) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse5 .cse1))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse7 .cse8))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse6 .cse1))))))))))) is different from false [2023-05-04 19:26:05,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_538 Int) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_545 Int) (v_ArrVal_554 Int) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_540 Int) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_537))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_538))) (store (store .cse11 .cse6 v_ArrVal_540) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_544))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_545))) (store (store .cse9 .cse6 v_ArrVal_547) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 80))) (let ((.cse0 (store (store (store .cse3 .cse6 v_ArrVal_553) .cse4 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557))) (or (= (select .cse0 .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse3 .cse1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_559) .cse1 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse4) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse7 .cse1)))))))))))) is different from false [2023-05-04 19:26:07,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_538 Int) (v_ArrVal_559 Int) (v_ArrVal_547 Int) (v_ArrVal_544 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_534 Int) (v_ArrVal_545 Int) (v_ArrVal_554 Int) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_553 Int) (v_ArrVal_536 (Array Int Int)) (v_ArrVal_540 Int) (v_ArrVal_560 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_534)))) (let ((.cse12 (store (store .cse7 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_537))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) v_ArrVal_538))) (store (store .cse13 .cse9 v_ArrVal_540) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_544))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) v_ArrVal_545))) (store (store .cse11 .cse9 v_ArrVal_547) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_551))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 80))) (let ((.cse4 (store (store (store .cse2 .cse9 v_ArrVal_553) .cse3 v_ArrVal_554) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20|) |c_~#queue~0.offset|) v_ArrVal_557))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_554) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_20| (select .cse2 .cse1))) (= 20 (select .cse4 .cse1)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| (select .cse5 .cse1))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (< (select .cse6 .cse1) (select .cse6 .cse3))) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_559) .cse1 v_ArrVal_560)) |c_~#stored_elements~0.base| v_ArrVal_562) |c_~#queue~0.base|) .cse3) 20))))))))))) is different from false [2023-05-04 19:26:07,837 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-04 19:26:07,838 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 2670 treesize of output 1923 [2023-05-04 19:26:07,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:26:07,941 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 4213 treesize of output 4139 [2023-05-04 19:26:07,979 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 1286 treesize of output 1222 [2023-05-04 19:26:08,040 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 2349 treesize of output 2317 [2023-05-04 19:26:08,076 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 3401 treesize of output 3305 [2023-05-04 19:26:08,111 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 3474 treesize of output 3426 [2023-05-04 19:26:08,152 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 3288 treesize of output 3224 [2023-05-04 19:26:20,890 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 1591 treesize of output 1511 [2023-05-04 19:26:28,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 19:26:28,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1844 treesize of output 1794 [2023-05-04 19:26:37,740 INFO L356 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2023-05-04 19:26:37,740 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 44 treesize of output 109 [2023-05-04 19:26:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-05-04 19:26:37,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27193458] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 19:26:37,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 19:26:37,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 54] total 141 [2023-05-04 19:26:37,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409882784] [2023-05-04 19:26:37,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 19:26:37,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 141 states [2023-05-04 19:26:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 19:26:37,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2023-05-04 19:26:37,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=14151, Unknown=203, NotChecked=3930, Total=19740 [2023-05-04 19:26:37,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:26:37,946 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 19:26:37,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 141 states, 141 states have (on average 5.7304964539007095) internal successors, (808), 141 states have internal predecessors, (808), 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 19:26:37,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 19:26:37,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-05-04 19:26:37,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 19:26:37,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 59 states. [2023-05-04 19:26:37,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 19:32:23,684 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification. DAG size of input: 86 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 19:33:10,883 WARN L233 SmtUtils]: Spent 14.53s on a formula simplification. DAG size of input: 101 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 19:33:45,185 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 19:33:45,185 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 19:33:45,185 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 19:33:45,185 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 19:33:45,185 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 19:33:46,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-05-04 19:33:46,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2023-05-04 19:33:46,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2023-05-04 19:33:46,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 19:33:46,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 19:33:46,364 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 197 known predicates. [2023-05-04 19:33:46,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 19:33:46,365 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-05-04 19:33:46,366 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2023-05-04 19:33:46,367 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 19:33:46,367 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 19:33:46,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 07:33:46 BasicIcfg [2023-05-04 19:33:46,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 19:33:46,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2023-05-04 19:33:46,373 INFO L158 Benchmark]: Toolchain (without parser) took 847958.73ms. Allocated memory was 254.8MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 224.3MB in the beginning and 911.6MB in the end (delta: -687.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-05-04 19:33:46,375 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 19:33:46,375 INFO L158 Benchmark]: CACSL2BoogieTranslator took 595.63ms. Allocated memory is still 254.8MB. Free memory was 223.7MB in the beginning and 202.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 19:33:46,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.91ms. Allocated memory is still 254.8MB. Free memory was 202.7MB in the beginning and 199.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 19:33:46,375 INFO L158 Benchmark]: Boogie Preprocessor took 38.90ms. Allocated memory is still 254.8MB. Free memory was 199.5MB in the beginning and 196.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 19:33:46,376 INFO L158 Benchmark]: RCFGBuilder took 547.58ms. Allocated memory is still 254.8MB. Free memory was 196.9MB in the beginning and 173.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-04 19:33:46,376 INFO L158 Benchmark]: TraceAbstraction took 846725.35ms. Allocated memory was 254.8MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 172.3MB in the beginning and 912.1MB in the end (delta: -739.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-05-04 19:33:46,377 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 137.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 595.63ms. Allocated memory is still 254.8MB. Free memory was 223.7MB in the beginning and 202.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.91ms. Allocated memory is still 254.8MB. Free memory was 202.7MB in the beginning and 199.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.90ms. Allocated memory is still 254.8MB. Free memory was 199.5MB in the beginning and 196.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 547.58ms. Allocated memory is still 254.8MB. Free memory was 196.9MB in the beginning and 173.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 846725.35ms. Allocated memory was 254.8MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 172.3MB in the beginning and 912.1MB in the end (delta: -739.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 24482, independent: 23760, independent conditional: 9629, independent unconditional: 14131, dependent: 722, dependent conditional: 652, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23856, independent: 23760, independent conditional: 9629, independent unconditional: 14131, dependent: 96, dependent conditional: 26, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23856, independent: 23760, independent conditional: 9629, independent unconditional: 14131, dependent: 96, dependent conditional: 26, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24036, independent: 23760, independent conditional: 51, independent unconditional: 23709, dependent: 276, dependent conditional: 129, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24036, independent: 23760, independent conditional: 51, independent unconditional: 23709, dependent: 276, dependent conditional: 32, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24036, independent: 23760, independent conditional: 51, independent unconditional: 23709, dependent: 276, dependent conditional: 32, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11468, independent: 11388, independent conditional: 25, independent unconditional: 11363, dependent: 80, dependent conditional: 10, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11468, independent: 11358, independent conditional: 0, independent unconditional: 11358, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 110, independent: 30, independent conditional: 25, independent unconditional: 5, dependent: 80, dependent conditional: 10, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 110, independent: 30, independent conditional: 25, independent unconditional: 5, dependent: 80, dependent conditional: 10, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 102, independent conditional: 57, independent unconditional: 45, dependent: 115, dependent conditional: 25, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 24036, independent: 12372, independent conditional: 26, independent unconditional: 12346, dependent: 196, dependent conditional: 22, dependent unconditional: 174, unknown: 11468, unknown conditional: 35, unknown unconditional: 11433] , Statistics on independence cache: Total cache size (in pairs): 11468, Positive cache size: 11388, Positive conditional cache size: 25, Positive unconditional cache size: 11363, Negative cache size: 80, Negative conditional cache size: 10, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97, Maximal queried relation: 5, Independence queries for same thread: 626 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1551, Number of trivial persistent sets: 1191, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14201, independent: 14131, independent conditional: 0, independent unconditional: 14131, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 24482, independent: 23760, independent conditional: 9629, independent unconditional: 14131, dependent: 722, dependent conditional: 652, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23856, independent: 23760, independent conditional: 9629, independent unconditional: 14131, dependent: 96, dependent conditional: 26, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23856, independent: 23760, independent conditional: 9629, independent unconditional: 14131, dependent: 96, dependent conditional: 26, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24036, independent: 23760, independent conditional: 51, independent unconditional: 23709, dependent: 276, dependent conditional: 129, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24036, independent: 23760, independent conditional: 51, independent unconditional: 23709, dependent: 276, dependent conditional: 32, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24036, independent: 23760, independent conditional: 51, independent unconditional: 23709, dependent: 276, dependent conditional: 32, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11468, independent: 11388, independent conditional: 25, independent unconditional: 11363, dependent: 80, dependent conditional: 10, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11468, independent: 11358, independent conditional: 0, independent unconditional: 11358, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 110, independent: 30, independent conditional: 25, independent unconditional: 5, dependent: 80, dependent conditional: 10, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 110, independent: 30, independent conditional: 25, independent unconditional: 5, dependent: 80, dependent conditional: 10, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 217, independent: 102, independent conditional: 57, independent unconditional: 45, dependent: 115, dependent conditional: 25, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 24036, independent: 12372, independent conditional: 26, independent unconditional: 12346, dependent: 196, dependent conditional: 22, dependent unconditional: 174, unknown: 11468, unknown conditional: 35, unknown unconditional: 11433] , Statistics on independence cache: Total cache size (in pairs): 11468, Positive cache size: 11388, Positive conditional cache size: 25, Positive unconditional cache size: 11363, Negative cache size: 80, Negative conditional cache size: 10, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97, Maximal queried relation: 5, Independence queries for same thread: 626 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8517, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 263, dependent conditional: 192, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8067, independent: 7996, independent conditional: 0, independent unconditional: 7996, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8067, independent: 7992, independent conditional: 0, independent unconditional: 7992, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8365, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8067, unknown conditional: 0, unknown unconditional: 8067] , Statistics on independence cache: Total cache size (in pairs): 8067, Positive cache size: 7996, Positive conditional cache size: 0, Positive unconditional cache size: 7996, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, 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: 172 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 208, Number of trivial persistent sets: 180, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8205, independent: 8134, independent conditional: 0, independent unconditional: 8134, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8517, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 263, dependent conditional: 192, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8345, independent: 8254, independent conditional: 120, independent unconditional: 8134, dependent: 91, dependent conditional: 20, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 20, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8365, independent: 8254, independent conditional: 0, independent unconditional: 8254, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8067, independent: 7996, independent conditional: 0, independent unconditional: 7996, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8067, independent: 7992, independent conditional: 0, independent unconditional: 7992, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8365, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 8067, unknown conditional: 0, unknown unconditional: 8067] , Statistics on independence cache: Total cache size (in pairs): 8067, Positive cache size: 7996, Positive conditional cache size: 0, Positive unconditional cache size: 7996, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, 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: 172 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12932, independent: 11959, independent conditional: 1911, independent unconditional: 10048, dependent: 973, dependent conditional: 926, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 1911, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 1911, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 0, independent unconditional: 11959, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 0, independent unconditional: 11959, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 0, independent unconditional: 11959, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9715, independent: 9668, independent conditional: 0, independent unconditional: 9668, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9715, independent: 9662, independent conditional: 0, independent unconditional: 9662, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12006, independent: 2291, independent conditional: 0, independent unconditional: 2291, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9715, unknown conditional: 0, unknown unconditional: 9715] , Statistics on independence cache: Total cache size (in pairs): 9715, Positive cache size: 9668, Positive conditional cache size: 0, Positive unconditional cache size: 9668, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 926 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 226, Number of trivial persistent sets: 185, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10095, independent: 10048, independent conditional: 0, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12932, independent: 11959, independent conditional: 1911, independent unconditional: 10048, dependent: 973, dependent conditional: 926, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 1911, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 1911, independent unconditional: 10048, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 0, independent unconditional: 11959, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 0, independent unconditional: 11959, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12006, independent: 11959, independent conditional: 0, independent unconditional: 11959, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9715, independent: 9668, independent conditional: 0, independent unconditional: 9668, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9715, independent: 9662, independent conditional: 0, independent unconditional: 9662, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 53, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 12006, independent: 2291, independent conditional: 0, independent unconditional: 2291, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9715, unknown conditional: 0, unknown unconditional: 9715] , Statistics on independence cache: Total cache size (in pairs): 9715, Positive cache size: 9668, Positive conditional cache size: 0, Positive unconditional cache size: 9668, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 926 - PositiveResult [Line: 1032]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 197 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 5.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 854 NumberOfCodeBlocks, 854 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 848 ConstructedInterpolants, 0 QuantifiedInterpolants, 10069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 67 NumberOfCodeBlocks, 67 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 66 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 831.5s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 588.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 199, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 242.4s InterpolantComputationTime, 1488 NumberOfCodeBlocks, 1488 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1776 ConstructedInterpolants, 220 QuantifiedInterpolants, 263644 SizeOfPredicates, 55 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 144 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 89/278 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown