/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 GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 04:28:13,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 04:28:13,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 04:28:13,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 04:28:13,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 04:28:13,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 04:28:13,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 04:28:13,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 04:28:13,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 04:28:13,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 04:28:13,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 04:28:13,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 04:28:13,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 04:28:13,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 04:28:13,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 04:28:13,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 04:28:13,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 04:28:13,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 04:28:13,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 04:28:13,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 04:28:13,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 04:28:13,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 04:28:13,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 04:28:13,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 04:28:13,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 04:28:13,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 04:28:13,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 04:28:13,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 04:28:13,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 04:28:13,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 04:28:13,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 04:28:13,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 04:28:13,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 04:28:13,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 04:28:13,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 04:28:13,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 04:28:13,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 04:28:13,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 04:28:13,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 04:28:13,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 04:28:13,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 04:28:13,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 04:28:13,684 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 04:28:13,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 04:28:13,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 04:28:13,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 04:28:13,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 04:28:13,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 04:28:13,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 04:28:13,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 04:28:13,687 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 04:28:13,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 04:28:13,687 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 04:28:13,688 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 04:28:13,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 04:28:13,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 04:28:13,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 04:28:13,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 04:28:13,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 04:28:13,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 04:28:13,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 04:28:13,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 04:28:13,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 04:28:13,691 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 04:28:13,691 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 04:28:13,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 04:28:13,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 04:28:13,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 04:28:13,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 04:28:13,691 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 04:28:13,691 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 -> GLOBAL_READ_WRITE [2023-05-20 04:28:13,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 04:28:13,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 04:28:13,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 04:28:13,954 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 04:28:13,955 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 04:28:13,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-05-20 04:28:14,021 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae68e213/b3d4695ea3824cefaddc1e08b8b11a1f/FLAG91bedb393 [2023-05-20 04:28:14,465 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 04:28:14,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-05-20 04:28:14,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae68e213/b3d4695ea3824cefaddc1e08b8b11a1f/FLAG91bedb393 [2023-05-20 04:28:14,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eae68e213/b3d4695ea3824cefaddc1e08b8b11a1f [2023-05-20 04:28:14,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 04:28:14,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 04:28:14,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 04:28:15,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 04:28:15,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 04:28:15,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 04:28:14" (1/1) ... [2023-05-20 04:28:15,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@86df86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15, skipping insertion in model container [2023-05-20 04:28:15,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 04:28:14" (1/1) ... [2023-05-20 04:28:15,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 04:28:15,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 04:28:15,442 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2023-05-20 04:28:15,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 04:28:15,477 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 04:28:15,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2023-05-20 04:28:15,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 04:28:15,575 INFO L208 MainTranslator]: Completed translation [2023-05-20 04:28:15,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15 WrapperNode [2023-05-20 04:28:15,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 04:28:15,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 04:28:15,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 04:28:15,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 04:28:15,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,625 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2023-05-20 04:28:15,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 04:28:15,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 04:28:15,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 04:28:15,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 04:28:15,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,660 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,661 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,662 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 04:28:15,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 04:28:15,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 04:28:15,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 04:28:15,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (1/1) ... [2023-05-20 04:28:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 04:28:15,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:28:15,690 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 04:28:15,692 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 04:28:15,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 04:28:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 04:28:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 04:28:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 04:28:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-20 04:28:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 04:28:15,718 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-20 04:28:15,718 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-20 04:28:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 04:28:15,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 04:28:15,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 04:28:15,720 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 04:28:15,842 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 04:28:15,844 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 04:28:16,165 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 04:28:16,172 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 04:28:16,172 INFO L300 CfgBuilder]: Removed 25 assume(true) statements. [2023-05-20 04:28:16,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 04:28:16 BoogieIcfgContainer [2023-05-20 04:28:16,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 04:28:16,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 04:28:16,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 04:28:16,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 04:28:16,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 04:28:14" (1/3) ... [2023-05-20 04:28:16,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fd68c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 04:28:16, skipping insertion in model container [2023-05-20 04:28:16,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:28:15" (2/3) ... [2023-05-20 04:28:16,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fd68c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 04:28:16, skipping insertion in model container [2023-05-20 04:28:16,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 04:28:16" (3/3) ... [2023-05-20 04:28:16,184 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2023-05-20 04:28:16,193 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 04:28:16,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 04:28:16,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-20 04:28:16,202 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 04:28:16,295 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-20 04:28:16,348 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:28:16,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 04:28:16,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:28:16,350 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 04:28:16,356 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 04:28:16,386 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 04:28:16,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-20 04:28:16,405 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;@38f59bf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:28:16,405 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 04:28:17,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:28:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:28:17,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1633298094, now seen corresponding path program 1 times [2023-05-20 04:28:17,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:28:17,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170864123] [2023-05-20 04:28:17,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:28:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:28:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:28:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2023-05-20 04:28:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:28:17,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170864123] [2023-05-20 04:28:17,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170864123] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:28:17,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:28:17,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:28:17,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145171590] [2023-05-20 04:28:17,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:28:17,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:28:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:28:17,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:28:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:28:17,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:17,662 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:28:17,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:28:17,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:17,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:17,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 04:28:17,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:28:17,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:28:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1117133567, now seen corresponding path program 1 times [2023-05-20 04:28:17,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:28:17,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139999688] [2023-05-20 04:28:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:28:17,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:28:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:28:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2023-05-20 04:28:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:28:18,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139999688] [2023-05-20 04:28:18,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139999688] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:28:18,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276493392] [2023-05-20 04:28:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:28:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:28:18,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:28:18,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:28:18,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 04:28:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:28:18,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 04:28:18,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:28:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2023-05-20 04:28:18,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:28:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1469 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2023-05-20 04:28:18,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276493392] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:28:18,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:28:18,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 04:28:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301600905] [2023-05-20 04:28:18,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:28:18,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:28:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:28:18,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:28:18,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 04:28:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:18,951 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:28:18,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:28:18,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:18,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:28:19,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-20 04:28:19,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-20 04:28:19,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:28:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:28:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash -494794113, now seen corresponding path program 2 times [2023-05-20 04:28:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:28:19,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380512787] [2023-05-20 04:28:19,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:28:19,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:28:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:28:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 257 proven. 1 refuted. 0 times theorem prover too weak. 1228 trivial. 0 not checked. [2023-05-20 04:28:19,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:28:19,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380512787] [2023-05-20 04:28:19,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380512787] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:28:19,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424065757] [2023-05-20 04:28:19,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:28:19,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:28:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:28:19,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:28:19,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 04:28:20,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:28:20,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:28:20,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 04:28:20,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:28:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2023-05-20 04:28:20,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:28:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2023-05-20 04:28:20,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424065757] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:28:20,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:28:20,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-20 04:28:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350992559] [2023-05-20 04:28:20,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:28:20,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-20 04:28:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:28:20,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-20 04:28:20,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-20 04:28:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:20,287 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:28:20,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.894736842105264) internal successors, (226), 19 states have internal predecessors, (226), 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 04:28:20,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:20,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:28:20,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:28:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:28:20,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-20 04:28:20,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:28:20,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:28:20,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:28:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -573418349, now seen corresponding path program 1 times [2023-05-20 04:28:20,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:28:20,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204149461] [2023-05-20 04:28:20,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:28:20,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:28:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:28:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-20 04:28:21,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:28:21,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204149461] [2023-05-20 04:28:21,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204149461] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:28:21,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953208295] [2023-05-20 04:28:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:28:21,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:28:21,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:28:21,147 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 04:28:21,179 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 04:28:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:28:21,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 04:28:21,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:28:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-20 04:28:21,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:28:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-20 04:28:21,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953208295] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:28:21,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:28:21,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-20 04:28:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629993641] [2023-05-20 04:28:21,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:28:21,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-20 04:28:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:28:21,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-20 04:28:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-20 04:28:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:21,596 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:28:21,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.043478260869565) internal successors, (139), 23 states have internal predecessors, (139), 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 04:28:21,596 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:28:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:28:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:28:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:28:21,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:28:21,941 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 04:28:22,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:28:22,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:28:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:28:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash -740299425, now seen corresponding path program 2 times [2023-05-20 04:28:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:28:22,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396653379] [2023-05-20 04:28:22,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:28:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:28:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:28:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:28:25,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:28:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396653379] [2023-05-20 04:28:25,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396653379] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:28:25,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323096868] [2023-05-20 04:28:25,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:28:25,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:28:25,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:28:25,557 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 04:28:25,559 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 04:28:25,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:28:25,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:28:25,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 36 conjunts are in the unsatisfiable core [2023-05-20 04:28:25,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:28:25,796 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 7 treesize of output 6 [2023-05-20 04:28:26,121 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:28:26,122 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 04:28:26,173 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 13 treesize of output 15 [2023-05-20 04:28:26,445 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-20 04:28:26,675 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 04:28:26,734 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 21 treesize of output 16 [2023-05-20 04:28:31,164 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 17 treesize of output 13 [2023-05-20 04:28:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:28:31,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:28:37,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-20 04:28:39,193 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 0))) is different from false [2023-05-20 04:28:41,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1069 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1069)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 04:28:41,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1069 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1068))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1069))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 0))) is different from false [2023-05-20 04:28:41,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1066 Int) (v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1069 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (= 0 (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1068))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1069))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 04:28:41,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1066 Int) (v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1069 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1068))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1069))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 0))) is different from false [2023-05-20 04:28:41,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1066 Int) (v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1069 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1068) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1069) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 0))) is different from false [2023-05-20 04:28:41,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1066 Int) (v_ArrVal_1068 (Array Int Int)) (v_ArrVal_1069 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| Int) (v_ArrVal_1065 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1065))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1068) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_71| v_ArrVal_1069) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_69|) 0))) is different from false [2023-05-20 04:28:42,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:28:42,595 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 57 treesize of output 53 [2023-05-20 04:28:42,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:28:42,604 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 22 treesize of output 20 [2023-05-20 04:28:42,651 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:28:42,651 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 13 treesize of output 12 [2023-05-20 04:28:42,656 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 13 not checked. [2023-05-20 04:28:42,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323096868] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:28:42,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:28:42,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 49 [2023-05-20 04:28:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519565147] [2023-05-20 04:28:42,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:28:42,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-20 04:28:42,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:28:42,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-20 04:28:42,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1473, Unknown=13, NotChecked=680, Total=2352 [2023-05-20 04:28:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:28:42,660 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:28:42,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.6938775510204085) internal successors, (279), 49 states have internal predecessors, (279), 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 04:28:42,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:28:42,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:28:42,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:28:42,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:28:42,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:09,661 WARN L233 SmtUtils]: Spent 16.06s on a formula simplification. DAG size of input: 67 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:29:18,012 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 61 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:29:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:29:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:29,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:29,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:29,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1140201171, now seen corresponding path program 3 times [2023-05-20 04:29:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:29,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003880410] [2023-05-20 04:29:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:30:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:30:44,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:30:44,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003880410] [2023-05-20 04:30:44,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003880410] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:30:44,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96554611] [2023-05-20 04:30:44,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 04:30:44,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:30:44,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:30:44,802 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 04:30:44,803 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 04:30:45,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-05-20 04:30:45,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:30:45,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 90 conjunts are in the unsatisfiable core [2023-05-20 04:30:45,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:30:45,361 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 7 treesize of output 6 [2023-05-20 04:30:45,861 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:30:45,862 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 04:30:46,167 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 13 treesize of output 15 [2023-05-20 04:30:46,858 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-20 04:30:47,189 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 29 treesize of output 24 [2023-05-20 04:30:48,749 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-05-20 04:30:49,519 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 54 treesize of output 47 [2023-05-20 04:30:51,137 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 04:30:51,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-05-20 04:30:51,730 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 24 treesize of output 19 [2023-05-20 04:30:53,050 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 27 treesize of output 23 [2023-05-20 04:30:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 5 proven. 134 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:30:53,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:30:58,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-20 04:31:00,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 04:31:02,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1243 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1243)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-20 04:31:02,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1243 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1243))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|)))) is different from false [2023-05-20 04:31:04,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1243 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0))) is different from false [2023-05-20 04:31:04,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:04,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_50| Int)) (or (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_50|)))) is different from false [2023-05-20 04:31:06,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:08,399 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:10,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:12,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse1 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:14,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:16,603 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:18,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:20,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:22,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:24,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int)) (or (forall ((v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_51|)))) is different from false [2023-05-20 04:31:27,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:29,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1233 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1233)))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse2 .cse3 (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:31,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1233 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_1233)))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse2 .cse3 (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:33,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1233 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (< |v_t_funThread1of1ForFork0_~i~0#1_51| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1233)) (.cse2 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:33,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1233 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1233)) (.cse2 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_51| 1) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:35,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (v_ArrVal_1233 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1243 Int) (v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1230))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (store (select .cse1 |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1233)) (.cse3 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse2 .cse3 (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_51| 1) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:35,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_51| Int) (v_ArrVal_1239 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| Int) (|v_t_funThread1of1ForFork0_~i~0#1_50| Int) (v_ArrVal_1233 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| Int) (v_ArrVal_1243 Int) (v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_50| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77|) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1230))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (store (select .cse1 |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1233)) (.cse3 (+ (* |v_t_funThread1of1ForFork0_~i~0#1_51| 28) |c_~#cache~0.offset|))) (store .cse2 .cse3 (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1239) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_77| v_ArrVal_1243) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_51| 1) (< |v_t_funThread1of1ForFork0_~i~0#1_50| (+ |v_t_funThread1of1ForFork0_~i~0#1_51| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_75| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-05-20 04:31:37,622 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:31:37,623 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:31:37,624 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:31:37,626 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 27 treesize of output 25 [2023-05-20 04:31:37,630 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:31:37,631 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 72 treesize of output 68 [2023-05-20 04:31:37,767 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:31:37,767 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 13 treesize of output 12 [2023-05-20 04:31:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 139 not checked. [2023-05-20 04:31:37,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96554611] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:37,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:37,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37, 35] total 97 [2023-05-20 04:31:37,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988349118] [2023-05-20 04:31:37,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:37,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2023-05-20 04:31:37,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:37,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2023-05-20 04:31:37,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=4773, Unknown=25, NotChecked=3960, Total=9312 [2023-05-20 04:31:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:37,857 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:37,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 5.11340206185567) internal successors, (496), 97 states have internal predecessors, (496), 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 04:31:37,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:37,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:37,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:31:37,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:37,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:37,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:32:16,621 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 89 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:32:39,505 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 129 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:32:46,443 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 132 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:32:53,210 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 132 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:33:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:33:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:33:04,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:33:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:33:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:33:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:33:04,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-05-20 04:33:04,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:33:04,877 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:33:04,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:33:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1829739047, now seen corresponding path program 1 times [2023-05-20 04:33:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:33:04,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198451065] [2023-05-20 04:33:04,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:33:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:33:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:38:56,258 WARN L233 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:39:20,767 WARN L233 SmtUtils]: Spent 10.45s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:39:41,079 WARN L233 SmtUtils]: Spent 10.40s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:41:34,343 WARN L233 SmtUtils]: Spent 9.75s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:41:55,951 WARN L233 SmtUtils]: Spent 10.50s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-20 04:42:00,254 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 04:42:00,279 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 04:42:00,411 WARN L249 SmtUtils]: Removed 2 from assertion stack [2023-05-20 04:42:00,413 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 04:42:00,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-20 04:42:00,413 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 286 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 8 for 26ms.. [2023-05-20 04:42:00,422 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2023-05-20 04:42:00,423 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-05-20 04:42:00,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 04:42:00,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 04:42:00,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 04:42:00 BasicIcfg [2023-05-20 04:42:00,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 04:42:00,428 INFO L158 Benchmark]: Toolchain (without parser) took 825431.20ms. Allocated memory was 191.9MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 168.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-05-20 04:42:00,428 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 191.9MB. Free memory was 151.6MB in the beginning and 151.5MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 04:42:00,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.85ms. Allocated memory is still 191.9MB. Free memory was 168.1MB in the beginning and 147.0MB in the end (delta: 21.1MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. [2023-05-20 04:42:00,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.30ms. Allocated memory is still 191.9MB. Free memory was 147.0MB in the beginning and 144.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 04:42:00,429 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 191.9MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 04:42:00,429 INFO L158 Benchmark]: RCFGBuilder took 509.47ms. Allocated memory is still 191.9MB. Free memory was 142.2MB in the beginning and 123.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-05-20 04:42:00,429 INFO L158 Benchmark]: TraceAbstraction took 824251.45ms. Allocated memory was 191.9MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 122.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-05-20 04:42:00,434 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.14ms. Allocated memory is still 191.9MB. Free memory was 151.6MB in the beginning and 151.5MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 576.85ms. Allocated memory is still 191.9MB. Free memory was 168.1MB in the beginning and 147.0MB in the end (delta: 21.1MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.30ms. Allocated memory is still 191.9MB. Free memory was 147.0MB in the beginning and 144.3MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 191.9MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 509.47ms. Allocated memory is still 191.9MB. Free memory was 142.2MB in the beginning and 123.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 824251.45ms. Allocated memory was 191.9MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 122.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30677, independent: 27694, independent conditional: 3171, independent unconditional: 24523, dependent: 2983, dependent conditional: 2873, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27849, independent: 27694, independent conditional: 3171, independent unconditional: 24523, dependent: 155, dependent conditional: 45, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27849, independent: 27694, independent conditional: 3171, independent unconditional: 24523, dependent: 155, dependent conditional: 45, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27886, independent: 27694, independent conditional: 1, independent unconditional: 27693, dependent: 192, dependent conditional: 36, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27886, independent: 27694, independent conditional: 1, independent unconditional: 27693, dependent: 192, dependent conditional: 4, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27886, independent: 27694, independent conditional: 1, independent unconditional: 27693, dependent: 192, dependent conditional: 4, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11154, independent: 11042, independent conditional: 1, independent unconditional: 11041, dependent: 112, dependent conditional: 2, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11154, independent: 10989, independent conditional: 0, independent unconditional: 10989, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 165, independent: 53, independent conditional: 1, independent unconditional: 52, dependent: 112, dependent conditional: 2, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 165, independent: 53, independent conditional: 1, independent unconditional: 52, dependent: 112, dependent conditional: 2, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 164, independent conditional: 3, independent unconditional: 161, dependent: 264, dependent conditional: 14, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27886, independent: 16652, independent conditional: 0, independent unconditional: 16652, dependent: 80, dependent conditional: 2, dependent unconditional: 78, unknown: 11154, unknown conditional: 3, unknown unconditional: 11151] , Statistics on independence cache: Total cache size (in pairs): 11154, Positive cache size: 11042, Positive conditional cache size: 1, Positive unconditional cache size: 11041, Negative cache size: 112, Negative conditional cache size: 2, Negative unconditional cache size: 110, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 1, Independence queries for same thread: 2828 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.6s, Number of persistent set computation: 779, Number of trivial persistent sets: 450, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24633, independent: 24523, independent conditional: 0, independent unconditional: 24523, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30677, independent: 27694, independent conditional: 3171, independent unconditional: 24523, dependent: 2983, dependent conditional: 2873, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27849, independent: 27694, independent conditional: 3171, independent unconditional: 24523, dependent: 155, dependent conditional: 45, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27849, independent: 27694, independent conditional: 3171, independent unconditional: 24523, dependent: 155, dependent conditional: 45, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27886, independent: 27694, independent conditional: 1, independent unconditional: 27693, dependent: 192, dependent conditional: 36, dependent unconditional: 156, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27886, independent: 27694, independent conditional: 1, independent unconditional: 27693, dependent: 192, dependent conditional: 4, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27886, independent: 27694, independent conditional: 1, independent unconditional: 27693, dependent: 192, dependent conditional: 4, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11154, independent: 11042, independent conditional: 1, independent unconditional: 11041, dependent: 112, dependent conditional: 2, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11154, independent: 10989, independent conditional: 0, independent unconditional: 10989, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 165, independent: 53, independent conditional: 1, independent unconditional: 52, dependent: 112, dependent conditional: 2, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 165, independent: 53, independent conditional: 1, independent unconditional: 52, dependent: 112, dependent conditional: 2, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 164, independent conditional: 3, independent unconditional: 161, dependent: 264, dependent conditional: 14, dependent unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 27886, independent: 16652, independent conditional: 0, independent unconditional: 16652, dependent: 80, dependent conditional: 2, dependent unconditional: 78, unknown: 11154, unknown conditional: 3, unknown unconditional: 11151] , Statistics on independence cache: Total cache size (in pairs): 11154, Positive cache size: 11042, Positive conditional cache size: 1, Positive unconditional cache size: 11041, Negative cache size: 112, Negative conditional cache size: 2, Negative unconditional cache size: 110, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 1, Independence queries for same thread: 2828 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 286 with TraceHistMax 10,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while SimplifyDDAWithTimeout was simplifying term of DAG size 8 for 26ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 226 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 824.1s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 135.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 150.1s InterpolantComputationTime, 3298 NumberOfCodeBlocks, 3263 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4788 ConstructedInterpolants, 476 QuantifiedInterpolants, 190558 SizeOfPredicates, 83 NumberOfNonLiveVariables, 3444 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 16 InterpolantComputations, 1 PerfectInterpolantSequences, 10750/11577 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown