/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 00:38:14,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 00:38:14,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 00:38:14,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 00:38:14,542 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 00:38:14,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 00:38:14,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 00:38:14,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 00:38:14,553 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 00:38:14,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 00:38:14,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 00:38:14,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 00:38:14,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 00:38:14,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 00:38:14,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 00:38:14,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 00:38:14,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 00:38:14,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 00:38:14,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 00:38:14,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 00:38:14,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 00:38:14,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 00:38:14,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 00:38:14,580 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 00:38:14,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 00:38:14,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 00:38:14,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 00:38:14,589 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 00:38:14,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 00:38:14,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 00:38:14,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 00:38:14,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 00:38:14,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 00:38:14,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 00:38:14,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 00:38:14,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 00:38:14,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 00:38:14,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 00:38:14,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 00:38:14,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 00:38:14,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 00:38:14,596 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 00:38:14,628 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 00:38:14,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 00:38:14,629 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 00:38:14,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 00:38:14,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 00:38:14,630 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 00:38:14,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 00:38:14,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 00:38:14,630 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 00:38:14,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 00:38:14,631 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 00:38:14,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 00:38:14,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 00:38:14,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 00:38:14,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 00:38:14,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 00:38:14,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 00:38:14,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 00:38:14,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 00:38:14,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 00:38:14,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 00:38:14,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-20 00:38:14,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 00:38:14,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 00:38:14,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 00:38:14,870 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 00:38:14,871 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 00:38:14,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-05-20 00:38:14,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ff87580/af570ad052ce42368f70a67cd1f25321/FLAG5df5b9345 [2023-05-20 00:38:15,470 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 00:38:15,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-05-20 00:38:15,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ff87580/af570ad052ce42368f70a67cd1f25321/FLAG5df5b9345 [2023-05-20 00:38:15,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9ff87580/af570ad052ce42368f70a67cd1f25321 [2023-05-20 00:38:15,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 00:38:15,802 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 00:38:15,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 00:38:15,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 00:38:15,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 00:38:15,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 12:38:15" (1/1) ... [2023-05-20 00:38:15,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd37fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:15, skipping insertion in model container [2023-05-20 00:38:15,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 12:38:15" (1/1) ... [2023-05-20 00:38:15,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 00:38:15,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 00:38:16,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-05-20 00:38:16,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-05-20 00:38:16,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-05-20 00:38:16,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 00:38:16,218 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 00:38:16,254 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43296,43309] [2023-05-20 00:38:16,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43503,43516] [2023-05-20 00:38:16,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i[43783,43796] [2023-05-20 00:38:16,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 00:38:16,308 INFO L208 MainTranslator]: Completed translation [2023-05-20 00:38:16,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16 WrapperNode [2023-05-20 00:38:16,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 00:38:16,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 00:38:16,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 00:38:16,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 00:38:16,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,360 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-05-20 00:38:16,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 00:38:16,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 00:38:16,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 00:38:16,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 00:38:16,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,399 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 00:38:16,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 00:38:16,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 00:38:16,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 00:38:16,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (1/1) ... [2023-05-20 00:38:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 00:38:16,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:38:16,450 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-20 00:38:16,464 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-20 00:38:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-20 00:38:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-20 00:38:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-20 00:38:16,485 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-20 00:38:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 00:38:16,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 00:38:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 00:38:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 00:38:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-20 00:38:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 00:38:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 00:38:16,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 00:38:16,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 00:38:16,488 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 00:38:16,609 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 00:38:16,611 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 00:38:17,021 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 00:38:17,032 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 00:38:17,032 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-20 00:38:17,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 12:38:17 BoogieIcfgContainer [2023-05-20 00:38:17,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 00:38:17,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 00:38:17,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 00:38:17,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 00:38:17,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 12:38:15" (1/3) ... [2023-05-20 00:38:17,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416f15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 12:38:17, skipping insertion in model container [2023-05-20 00:38:17,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 12:38:16" (2/3) ... [2023-05-20 00:38:17,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416f15b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 12:38:17, skipping insertion in model container [2023-05-20 00:38:17,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 12:38:17" (3/3) ... [2023-05-20 00:38:17,043 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-05-20 00:38:17,050 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 00:38:17,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 00:38:17,060 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-20 00:38:17,060 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 00:38:17,164 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 00:38:17,223 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 00:38:17,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 00:38:17,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:38:17,226 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-20 00:38:17,249 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-20 00:38:17,276 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 00:38:17,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-20 00:38:17,306 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;@677f3f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 00:38:17,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 00:38:17,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:17,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:17,739 INFO L85 PathProgramCache]: Analyzing trace with hash 215206652, now seen corresponding path program 1 times [2023-05-20 00:38:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:17,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389431792] [2023-05-20 00:38:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:19,192 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-20 00:38:19,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:19,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389431792] [2023-05-20 00:38:19,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389431792] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:19,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:19,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-20 00:38:19,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453442989] [2023-05-20 00:38:19,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:19,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-20 00:38:19,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:19,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-20 00:38:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-20 00:38:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:19,230 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:19,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.416666666666666) internal successors, (161), 12 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:19,233 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:19,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 00:38:19,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:19,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:19,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1274971090, now seen corresponding path program 1 times [2023-05-20 00:38:19,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:19,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381569544] [2023-05-20 00:38:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:19,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:19,876 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-20 00:38:19,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:19,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381569544] [2023-05-20 00:38:19,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381569544] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:19,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:19,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 00:38:19,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946940278] [2023-05-20 00:38:19,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:19,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 00:38:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 00:38:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 00:38:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:19,880 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:19,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:19,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:19,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:19,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:19,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:19,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 00:38:19,944 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1662794902, now seen corresponding path program 1 times [2023-05-20 00:38:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:19,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314319942] [2023-05-20 00:38:19,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:20,043 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-20 00:38:20,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:20,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314319942] [2023-05-20 00:38:20,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314319942] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:20,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:20,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 00:38:20,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834910393] [2023-05-20 00:38:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:20,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 00:38:20,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:20,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 00:38:20,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 00:38:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:20,054 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:20,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:20,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:20,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:20,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:20,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:20,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-20 00:38:20,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1133987975, now seen corresponding path program 1 times [2023-05-20 00:38:20,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:20,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834152731] [2023-05-20 00:38:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:28,869 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-20 00:38:28,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:28,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834152731] [2023-05-20 00:38:28,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834152731] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:28,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:28,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-20 00:38:28,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910904886] [2023-05-20 00:38:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:28,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-20 00:38:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:28,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-20 00:38:28,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2023-05-20 00:38:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:28,873 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:28,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.517241379310345) internal successors, (131), 29 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:28,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:28,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:28,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:28,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 00:38:31,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-20 00:38:31,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1285883828, now seen corresponding path program 1 times [2023-05-20 00:38:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:31,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462121128] [2023-05-20 00:38:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:32,035 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-20 00:38:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:32,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462121128] [2023-05-20 00:38:32,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462121128] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:32,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:32,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 00:38:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549828643] [2023-05-20 00:38:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:32,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 00:38:32,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:32,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 00:38:32,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 00:38:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:32,038 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:32,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 00:38:32,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-20 00:38:33,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:33,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-20 00:38:33,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:33,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:33,803 INFO L85 PathProgramCache]: Analyzing trace with hash -152943195, now seen corresponding path program 2 times [2023-05-20 00:38:33,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:33,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494829820] [2023-05-20 00:38:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:36,917 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-20 00:38:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:36,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494829820] [2023-05-20 00:38:36,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494829820] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:36,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:36,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-05-20 00:38:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517808481] [2023-05-20 00:38:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:36,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-05-20 00:38:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-05-20 00:38:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2023-05-20 00:38:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:36,919 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:36,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:36,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:36,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:36,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:36,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-20 00:38:36,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:36,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-20 00:38:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 00:38:40,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-20 00:38:40,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:40,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1358128959, now seen corresponding path program 1 times [2023-05-20 00:38:40,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:40,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104170265] [2023-05-20 00:38:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:40,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:40,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:40,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104170265] [2023-05-20 00:38:40,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104170265] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:40,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:40,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 00:38:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678071794] [2023-05-20 00:38:40,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:40,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 00:38:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 00:38:40,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 00:38:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:40,299 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:40,299 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-20 00:38:40,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:40,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:40,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:40,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-05-20 00:38:40,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:40,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 00:38:40,299 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-20 00:38:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 00:38:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 00:38:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:40,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 00:38:40,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-20 00:38:40,489 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-05-20 00:38:40,490 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-20 00:38:40,500 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 00:38:40,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 00:38:40,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:38:40,506 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-20 00:38:40,507 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-20 00:38:40,512 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 00:38:40,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 00:38:40,515 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;@677f3f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 00:38:40,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-20 00:38:40,705 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-20 00:38:40,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1422695656, now seen corresponding path program 1 times [2023-05-20 00:38:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:40,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378659745] [2023-05-20 00:38:40,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:40,722 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-20 00:38:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378659745] [2023-05-20 00:38:40,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378659745] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:40,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:40,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 00:38:40,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101542393] [2023-05-20 00:38:40,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:40,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 00:38:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 00:38:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 00:38:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:40,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:40,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:40,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:40,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:40,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-20 00:38:40,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-20 00:38:40,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-20 00:38:40,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-20 00:38:40,739 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-20 00:38:40,740 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-20 00:38:40,743 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 00:38:40,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 00:38:40,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:38:40,782 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-20 00:38:40,784 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-20 00:38:40,785 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 00:38:40,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-20 00:38:40,787 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;@677f3f28, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 00:38:40,787 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 00:38:40,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:40,904 INFO L85 PathProgramCache]: Analyzing trace with hash 623107423, now seen corresponding path program 1 times [2023-05-20 00:38:40,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:40,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337058741] [2023-05-20 00:38:40,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:40,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:41,337 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-20 00:38:41,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337058741] [2023-05-20 00:38:41,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337058741] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:41,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:41,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-20 00:38:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333873230] [2023-05-20 00:38:41,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:41,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-20 00:38:41,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:41,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-20 00:38:41,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-20 00:38:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:41,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:41,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:41,340 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:41,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-20 00:38:41,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:41,612 INFO L85 PathProgramCache]: Analyzing trace with hash 175723025, now seen corresponding path program 1 times [2023-05-20 00:38:41,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:41,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925888848] [2023-05-20 00:38:41,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:41,707 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-20 00:38:41,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:41,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925888848] [2023-05-20 00:38:41,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925888848] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:41,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:41,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 00:38:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613062226] [2023-05-20 00:38:41,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:41,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 00:38:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 00:38:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 00:38:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:41,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:41,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:41,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:41,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:41,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-20 00:38:41,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1360987719, now seen corresponding path program 1 times [2023-05-20 00:38:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:41,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247009] [2023-05-20 00:38:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:41,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:41,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:41,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247009] [2023-05-20 00:38:41,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247009] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 00:38:41,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888411034] [2023-05-20 00:38:41,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:41,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:38:41,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:38:41,970 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-20 00:38:41,984 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-20 00:38:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:42,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 00:38:42,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 00:38:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:42,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 00:38:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:42,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888411034] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 00:38:42,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 00:38:42,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 00:38:42,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982074229] [2023-05-20 00:38:42,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 00:38:42,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 00:38:42,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:42,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 00:38:42,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 00:38:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:42,388 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:42,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.9) internal successors, (319), 10 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:42,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:42,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 00:38:42,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:38:42,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:42,673 INFO L85 PathProgramCache]: Analyzing trace with hash -781158759, now seen corresponding path program 2 times [2023-05-20 00:38:42,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:42,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651560018] [2023-05-20 00:38:42,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:42,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:42,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651560018] [2023-05-20 00:38:42,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651560018] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 00:38:42,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171511856] [2023-05-20 00:38:42,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 00:38:42,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:38:42,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:38:42,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 00:38:42,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-20 00:38:43,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 00:38:43,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 00:38:43,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 00:38:43,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 00:38:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:43,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 00:38:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 69 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:43,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171511856] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 00:38:43,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 00:38:43,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 00:38:43,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900562589] [2023-05-20 00:38:43,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 00:38:43,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 00:38:43,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:43,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 00:38:43,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 00:38:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:43,697 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:43,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 27.944444444444443) internal successors, (503), 18 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:43,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:43,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:43,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:43,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:43,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:38:43,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-05-20 00:38:44,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-20 00:38:44,117 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 184827993, now seen corresponding path program 3 times [2023-05-20 00:38:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:44,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184193938] [2023-05-20 00:38:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 161 proven. 1022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 00:38:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184193938] [2023-05-20 00:38:44,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184193938] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 00:38:44,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891798763] [2023-05-20 00:38:44,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 00:38:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:38:44,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:38:44,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 00:38:44,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-20 00:38:45,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-05-20 00:38:45,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 00:38:45,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 38 conjunts are in the unsatisfiable core [2023-05-20 00:38:45,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 00:38:46,443 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-20 00:38:46,731 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-20 00:38:46,755 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-20 00:38:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 336 proven. 131 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-05-20 00:38:46,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 00:38:46,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-05-20 00:38:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1183 backedges. 448 proven. 19 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-05-20 00:38:47,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891798763] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 00:38:47,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 00:38:47,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 8] total 32 [2023-05-20 00:38:47,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160123276] [2023-05-20 00:38:47,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 00:38:47,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-20 00:38:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-20 00:38:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2023-05-20 00:38:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:47,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:47,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 26.09375) internal successors, (835), 32 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:47,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:47,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:47,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:47,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:38:47,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:38:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-05-20 00:38:49,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-20 00:38:49,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:38:49,869 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:49,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash 311879572, now seen corresponding path program 1 times [2023-05-20 00:38:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:49,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451231842] [2023-05-20 00:38:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2750 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 2706 trivial. 0 not checked. [2023-05-20 00:38:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:50,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451231842] [2023-05-20 00:38:50,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451231842] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:50,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:50,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 00:38:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732838913] [2023-05-20 00:38:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:50,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 00:38:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:50,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 00:38:50,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 00:38:50,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:50,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:50,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:50,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:50,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:50,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:50,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:38:50,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2023-05-20 00:38:50,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:38:51,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-05-20 00:38:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:51,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-20 00:38:51,087 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1640010320, now seen corresponding path program 1 times [2023-05-20 00:38:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:51,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15690834] [2023-05-20 00:38:51,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:38:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2009 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2023-05-20 00:38:51,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:38:51,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15690834] [2023-05-20 00:38:51,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15690834] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 00:38:51,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 00:38:51,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 00:38:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866569325] [2023-05-20 00:38:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 00:38:51,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 00:38:51,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:38:51,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 00:38:51,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 00:38:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:51,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:38:51,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:38:51,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:51,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:51,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:51,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:38:51,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2023-05-20 00:38:51,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:51,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:38:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:38:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:38:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:38:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-20 00:38:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:38:52,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-20 00:38:52,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:38:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:38:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1086958796, now seen corresponding path program 1 times [2023-05-20 00:38:52,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:38:52,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928093100] [2023-05-20 00:38:52,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:38:52,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:38:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:39:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1176 proven. 141 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2023-05-20 00:39:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:39:00,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928093100] [2023-05-20 00:39:00,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928093100] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 00:39:00,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326538467] [2023-05-20 00:39:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:39:00,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:39:00,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:39:00,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 00:39:00,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-20 00:39:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:39:00,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 61 conjunts are in the unsatisfiable core [2023-05-20 00:39:00,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 00:39:03,432 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-20 00:39:03,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:03,829 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-05-20 00:39:03,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 48 [2023-05-20 00:39:03,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:03,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:03,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2023-05-20 00:39:04,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-05-20 00:39:04,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:04,272 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-20 00:39:04,443 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-20 00:39:04,457 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-20 00:39:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1767 proven. 147 refuted. 0 times theorem prover too weak. 918 trivial. 0 not checked. [2023-05-20 00:39:04,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 00:39:05,761 INFO L356 Elim1Store]: treesize reduction 233, result has 45.2 percent of original size [2023-05-20 00:39:05,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 210 treesize of output 361 [2023-05-20 00:39:05,806 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-05-20 00:39:05,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 218 treesize of output 212 [2023-05-20 00:39:05,834 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-05-20 00:39:05,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 270 treesize of output 257 [2023-05-20 00:39:05,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-05-20 00:39:05,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:39:05,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 84 [2023-05-20 00:39:05,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-20 00:39:05,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-20 00:39:06,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-20 00:39:06,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:39:06,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2023-05-20 00:39:06,142 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:39:06,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 134 treesize of output 184 [2023-05-20 00:39:06,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:39:06,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 72 [2023-05-20 00:39:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2832 backedges. 1567 proven. 320 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2023-05-20 00:39:07,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326538467] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 00:39:07,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 00:39:07,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 57 [2023-05-20 00:39:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106755824] [2023-05-20 00:39:07,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 00:39:07,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-05-20 00:39:07,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:39:07,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-05-20 00:39:07,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=2712, Unknown=41, NotChecked=0, Total=3192 [2023-05-20 00:39:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:39:07,609 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:39:07,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 18.087719298245613) internal successors, (1031), 57 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:07,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:39:09,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:39:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:39:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:39:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-20 00:39:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:39:09,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-20 00:39:09,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:39:09,565 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:39:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:39:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1968058577, now seen corresponding path program 1 times [2023-05-20 00:39:09,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:39:09,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521248378] [2023-05-20 00:39:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:39:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:39:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:39:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-20 00:39:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:39:23,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521248378] [2023-05-20 00:39:23,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521248378] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 00:39:23,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431239475] [2023-05-20 00:39:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:39:23,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:39:23,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:39:23,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 00:39:23,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-20 00:39:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:39:24,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 101 conjunts are in the unsatisfiable core [2023-05-20 00:39:24,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 00:39:24,578 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-20 00:39:24,579 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-20 00:39:24,621 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 00:39:24,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 00:39:24,792 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-20 00:39:24,845 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-20 00:39:25,346 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-20 00:39:25,482 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-20 00:39:25,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:25,829 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 00:39:25,845 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-20 00:39:25,846 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-20 00:39:25,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:25,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:25,943 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-20 00:39:26,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2023-05-20 00:39:26,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:26,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-05-20 00:39:26,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:26,940 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 00:39:26,956 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-20 00:39:26,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2023-05-20 00:39:27,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:27,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:27,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-05-20 00:39:27,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-20 00:39:27,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:27,241 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-20 00:39:27,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:39:27,491 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-20 00:39:27,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-05-20 00:39:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-20 00:39:27,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 00:39:27,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2038 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2023-05-20 00:39:28,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (<= v_ArrVal_2030 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))))) is different from false [2023-05-20 00:39:28,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))) is different from false [2023-05-20 00:39:28,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2031 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse0 .cse1))) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2030)))))) is different from false [2023-05-20 00:39:29,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse1 .cse2)))))))) is different from false [2023-05-20 00:39:29,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2025)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse4 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store (store (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2030)))))) is different from false [2023-05-20 00:39:29,187 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse0 .cse1))) (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2025))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (or (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse4 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse3 .cse4))))))))))) is different from false [2023-05-20 00:39:29,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2036 Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2027 Int) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse4 .cse1))) (not (= (select (select (store (store .cse5 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2034) .cse3 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))) is different from false [2023-05-20 00:39:44,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int) (v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (v_ArrVal_2036 Int) (v_ArrVal_2027 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2024))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse4 (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2027) .cse1 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse3 .cse1))) (not (= 800 (select (select (store (store .cse4 |c_~#queue~0.base| (store (store (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) .cse5 v_ArrVal_2034) .cse1 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|))))))))))) is different from false [2023-05-20 00:39:45,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| Int) (v_ArrVal_2038 (Array Int Int)) (v_ArrVal_2024 (Array Int Int)) (v_ArrVal_2023 (Array Int Int)) (v_ArrVal_2031 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| Int) (v_ArrVal_2030 Int) (v_ArrVal_2034 Int) (v_ArrVal_2022 Int) (v_ArrVal_2033 Int) (v_ArrVal_2025 Int) (v_ArrVal_2036 Int) (v_ArrVal_2027 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_2022)))) (let ((.cse9 (store (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2024))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81|)) v_ArrVal_2025)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_2027) .cse2 v_ArrVal_2030)) |c_~#stored_elements~0.base| v_ArrVal_2031))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (< (+ 1 (select .cse4 .cse2)) v_ArrVal_2030) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78| (select .cse5 .cse2))) (not (= (select (select (store (store .cse6 |c_~#queue~0.base| (store (store (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_78|) |c_~#queue~0.offset|) v_ArrVal_2033) .cse7 v_ArrVal_2034) .cse2 v_ArrVal_2036)) |c_~#stored_elements~0.base| v_ArrVal_2038) |c_~#queue~0.base|) .cse1) 800)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_81| (select .cse8 .cse2))))))))))) is different from false [2023-05-20 00:39:45,717 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-20 00:39:45,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1163 treesize of output 1031 [2023-05-20 00:39:45,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:39:45,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1542 treesize of output 1510 [2023-05-20 00:39:45,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 794 treesize of output 762 [2023-05-20 00:39:45,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 598 treesize of output 566 [2023-05-20 00:39:45,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 729 treesize of output 697 [2023-05-20 00:39:45,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 745 treesize of output 733 [2023-05-20 00:39:46,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2023-05-20 00:39:46,769 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:39:46,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 272 treesize of output 258 [2023-05-20 00:39:48,551 INFO L356 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2023-05-20 00:39:48,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 131 [2023-05-20 00:39:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 644 proven. 5 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2023-05-20 00:39:48,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431239475] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 00:39:48,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 00:39:48,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 37] total 100 [2023-05-20 00:39:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039250014] [2023-05-20 00:39:48,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 00:39:48,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2023-05-20 00:39:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:39:48,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2023-05-20 00:39:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=7270, Unknown=48, NotChecked=1850, Total=9900 [2023-05-20 00:39:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:39:48,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:39:48,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 6.6) internal successors, (660), 100 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:39:48,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:39:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:39:56,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-05-20 00:39:56,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-20 00:39:57,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-20 00:39:57,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:39:57,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:39:57,069 INFO L85 PathProgramCache]: Analyzing trace with hash 11641223, now seen corresponding path program 2 times [2023-05-20 00:39:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:39:57,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038967759] [2023-05-20 00:39:57,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:39:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:39:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 00:40:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 1986 proven. 967 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2023-05-20 00:40:26,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 00:40:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038967759] [2023-05-20 00:40:26,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038967759] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 00:40:26,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875441725] [2023-05-20 00:40:26,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 00:40:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 00:40:26,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 00:40:26,641 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 00:40:26,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-20 00:40:27,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 00:40:27,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 00:40:27,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 125 conjunts are in the unsatisfiable core [2023-05-20 00:40:27,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 00:40:31,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-05-20 00:40:32,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:32,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2023-05-20 00:40:32,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:32,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2023-05-20 00:40:32,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-05-20 00:40:33,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:33,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 00:40:33,747 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-20 00:40:33,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2023-05-20 00:40:33,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:33,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:33,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2023-05-20 00:40:34,647 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-20 00:40:34,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:34,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-05-20 00:40:35,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:35,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:35,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2023-05-20 00:40:36,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2023-05-20 00:40:37,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:37,999 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 00:40:38,020 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2023-05-20 00:40:38,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2023-05-20 00:40:38,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:38,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:38,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2023-05-20 00:40:39,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 34 [2023-05-20 00:40:39,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 00:40:39,302 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-20 00:40:39,608 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-20 00:40:39,624 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-20 00:40:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 1457 proven. 288 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2023-05-20 00:40:39,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 00:40:39,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2529 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) (+ 3200 |c_~#queue~0.offset|)) 800)) is different from false [2023-05-20 00:41:35,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse0 .cse4 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse5))) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2525) .cse5 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= 800 (select .cse3 .cse5))))))) is different from false [2023-05-20 00:41:35,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse4 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store (store .cse0 .cse5 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (= 800 (select .cse2 .cse3)) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800)))))) is different from false [2023-05-20 00:41:35,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse0 .cse4 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* 4 (select .cse0 .cse5)) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2525) .cse5 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= 800 (select .cse3 .cse5))))))) is different from false [2023-05-20 00:41:35,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store (store .cse5 .cse2 v_ArrVal_2519) .cse4 v_ArrVal_2521) (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse4) 800) (= (select .cse1 .cse3) 800) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_2521)))))) is different from false [2023-05-20 00:41:40,400 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store (store .cse5 .cse2 v_ArrVal_2519) .cse4 v_ArrVal_2521) (+ (* (select .cse5 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse4) 800) (= (select .cse1 .cse3) 800) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_2521)))))) (= 800 .cse8)))) is different from false [2023-05-20 00:41:40,473 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse2 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse0 .cse4 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse0 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2525) .cse5 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= (select .cse3 .cse5) 800)))))) (= 800 .cse8)))) is different from false [2023-05-20 00:41:40,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2512)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse7 .cse8))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse8 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store (store .cse0 .cse6 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* (select .cse0 .cse3) 4)) v_ArrVal_2524))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (= 800 (select .cse2 .cse3)) (= .cse4 800) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse6 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800)))))))) is different from false [2023-05-20 00:41:40,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* (select .cse9 .cse8) 4)) v_ArrVal_2512)))) (let ((.cse4 (select .cse7 .cse8))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2514) .cse8 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store (store .cse2 .cse6 v_ArrVal_2519) .cse3 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2524))) (or (= 800 (select .cse0 .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2521) (= .cse4 800) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse3) 800))))))))) is different from false [2023-05-20 00:41:40,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2519 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 (select .cse9 .cse8))) v_ArrVal_2512)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2514) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse0 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse1 (store (store (store .cse6 .cse2 v_ArrVal_2519) .cse4 v_ArrVal_2521) (+ |c_~#queue~0.offset| (* 4 (select .cse6 .cse3))) v_ArrVal_2524))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse4) 800) (= 800 (select .cse1 .cse3)) (= 800 .cse5) (< (+ (select .cse6 .cse4) 1) v_ArrVal_2521))))))))) is different from false [2023-05-20 00:42:17,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2508 Int) (v_ArrVal_2519 Int) (v_ArrVal_2510 Int) (v_ArrVal_2521 Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2507 (Array Int Int)) (v_ArrVal_2518 (Array Int Int)) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2507))) (let ((.cse5 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse8 |c_~#queue~0.base|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store (store .cse0 .cse5 v_ArrVal_2508) .cse1 v_ArrVal_2510) (+ (* (select .cse0 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2512))) (let ((.cse7 (select .cse9 .cse6))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2514) .cse6 (+ 1 .cse7))) |c_~#stored_elements~0.base| v_ArrVal_2518))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse2 .cse5 v_ArrVal_2519) .cse1 v_ArrVal_2521) (+ (* (select .cse2 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (or (not (= 800 (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2521) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2525) .cse6 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|) .cse1) 800) (= 800 (select .cse4 .cse6)) (not (<= v_ArrVal_2510 1)) (= 800 .cse7)))))))))) is different from false [2023-05-20 00:42:40,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:42:40,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1270 treesize of output 682 [2023-05-20 00:42:40,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:42:40,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 912 treesize of output 884 [2023-05-20 00:42:40,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 354 [2023-05-20 00:42:40,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 770 treesize of output 722 [2023-05-20 00:42:40,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 317 [2023-05-20 00:42:40,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-05-20 00:42:40,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 00:42:40,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 266 [2023-05-20 00:42:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3531 backedges. 128 proven. 1040 refuted. 189 times theorem prover too weak. 1877 trivial. 297 not checked. [2023-05-20 00:42:57,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875441725] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 00:42:57,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 00:42:57,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 43, 45] total 154 [2023-05-20 00:42:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035270010] [2023-05-20 00:42:57,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 00:42:57,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 154 states [2023-05-20 00:42:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 00:42:57,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2023-05-20 00:42:57,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2104, Invalid=18019, Unknown=227, NotChecked=3212, Total=23562 [2023-05-20 00:42:57,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:42:57,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 00:42:57,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 154 states, 154 states have (on average 9.253246753246753) internal successors, (1425), 154 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 00:42:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:42:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:42:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:42:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:42:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2023-05-20 00:42:57,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:42:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:42:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:42:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-05-20 00:42:57,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 00:43:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-05-20 00:43:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2023-05-20 00:43:20,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-20 00:43:20,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-20 00:43:20,356 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 00:43:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 00:43:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 404558085, now seen corresponding path program 3 times [2023-05-20 00:43:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 00:43:20,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843741596] [2023-05-20 00:43:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 00:43:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 00:43:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-05-20 00:51:21,573 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-20 00:51:21,573 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-20 00:51:21,573 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-20 00:51:21,573 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-20 00:51:22,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-05-20 00:51:22,064 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-20 00:51:22,068 INFO L158 Benchmark]: Toolchain (without parser) took 786265.30ms. Allocated memory was 278.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 246.6MB in the beginning and 771.0MB in the end (delta: -524.4MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-05-20 00:51:22,072 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 00:51:22,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.68ms. Allocated memory is still 278.9MB. Free memory was 246.1MB in the beginning and 228.0MB in the end (delta: 18.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-05-20 00:51:22,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 278.9MB. Free memory was 228.0MB in the beginning and 225.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 00:51:22,073 INFO L158 Benchmark]: Boogie Preprocessor took 42.62ms. Allocated memory is still 278.9MB. Free memory was 225.0MB in the beginning and 222.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 00:51:22,074 INFO L158 Benchmark]: RCFGBuilder took 630.16ms. Allocated memory is still 278.9MB. Free memory was 222.9MB in the beginning and 199.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-20 00:51:22,074 INFO L158 Benchmark]: TraceAbstraction took 785029.85ms. Allocated memory was 278.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 198.3MB in the beginning and 771.0MB in the end (delta: -572.7MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-05-20 00:51:22,075 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 178.3MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 505.68ms. Allocated memory is still 278.9MB. Free memory was 246.1MB in the beginning and 228.0MB in the end (delta: 18.1MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 278.9MB. Free memory was 228.0MB in the beginning and 225.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.62ms. Allocated memory is still 278.9MB. Free memory was 225.0MB in the beginning and 222.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 630.16ms. Allocated memory is still 278.9MB. Free memory was 222.9MB in the beginning and 199.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 785029.85ms. Allocated memory was 278.9MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 198.3MB in the beginning and 771.0MB in the end (delta: -572.7MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31239, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 1216, dependent conditional: 1142, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 531, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11543, independent: 11457, independent conditional: 14, independent unconditional: 11443, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11543, independent: 11439, independent conditional: 0, independent unconditional: 11439, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, independent: 112, independent conditional: 47, independent unconditional: 64, dependent: 211, dependent conditional: 48, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30862, independent: 18566, independent conditional: 110, independent unconditional: 18456, dependent: 753, dependent conditional: 135, dependent unconditional: 618, unknown: 11543, unknown conditional: 26, unknown unconditional: 11517] , Statistics on independence cache: Total cache size (in pairs): 11543, Positive cache size: 11457, Positive conditional cache size: 14, Positive unconditional cache size: 11443, Negative cache size: 86, Negative conditional cache size: 12, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 384, Maximal queried relation: 6, Independence queries for same thread: 1032 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 2799, Number of trivial persistent sets: 2645, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12896, independent: 12822, independent conditional: 0, independent unconditional: 12822, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31239, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 1216, dependent conditional: 1142, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30207, independent: 30023, independent conditional: 17201, independent unconditional: 12822, dependent: 184, dependent conditional: 110, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 531, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30862, independent: 30023, independent conditional: 124, independent unconditional: 29899, dependent: 839, dependent conditional: 147, dependent unconditional: 692, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11543, independent: 11457, independent conditional: 14, independent unconditional: 11443, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11543, independent: 11439, independent conditional: 0, independent unconditional: 11439, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 18, independent conditional: 14, independent unconditional: 4, dependent: 86, dependent conditional: 12, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, independent: 112, independent conditional: 47, independent unconditional: 64, dependent: 211, dependent conditional: 48, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 30862, independent: 18566, independent conditional: 110, independent unconditional: 18456, dependent: 753, dependent conditional: 135, dependent unconditional: 618, unknown: 11543, unknown conditional: 26, unknown unconditional: 11517] , Statistics on independence cache: Total cache size (in pairs): 11543, Positive cache size: 11457, Positive conditional cache size: 14, Positive unconditional cache size: 11443, Negative cache size: 86, Negative conditional cache size: 12, Negative unconditional cache size: 74, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 384, Maximal queried relation: 6, Independence queries for same thread: 1032 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8603, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 187, dependent conditional: 112, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8551, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 72 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 241, Number of trivial persistent sets: 210, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8253, independent: 8178, independent conditional: 0, independent unconditional: 8178, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8603, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 187, dependent conditional: 112, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8531, independent: 8416, independent conditional: 238, independent unconditional: 8178, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8551, independent: 8416, independent conditional: 0, independent unconditional: 8416, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8115, independent: 8040, independent conditional: 0, independent unconditional: 8040, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8115, independent: 8036, independent conditional: 0, independent unconditional: 8036, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 134, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8551, independent: 376, independent conditional: 0, independent unconditional: 376, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8115, unknown conditional: 0, unknown unconditional: 8115] , Statistics on independence cache: Total cache size (in pairs): 8115, Positive cache size: 8040, Positive conditional cache size: 0, Positive unconditional cache size: 8040, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 72 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown