/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 LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 11:20:54,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 11:20:54,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 11:20:54,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 11:20:54,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 11:20:54,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 11:20:54,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 11:20:54,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 11:20:54,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 11:20:54,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 11:20:54,223 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 11:20:54,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 11:20:54,224 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 11:20:54,224 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 11:20:54,225 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 11:20:54,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 11:20:54,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 11:20:54,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 11:20:54,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 11:20:54,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 11:20:54,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 11:20:54,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 11:20:54,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 11:20:54,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 11:20:54,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 11:20:54,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 11:20:54,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 11:20:54,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 11:20:54,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 11:20:54,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 11:20:54,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 11:20:54,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 11:20:54,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 11:20:54,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 11:20:54,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 11:20:54,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 11:20:54,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 11:20:54,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 11:20:54,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 11:20:54,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 11:20:54,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 11:20:54,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 11:20:54,264 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 11:20:54,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 11:20:54,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 11:20:54,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 11:20:54,265 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 11:20:54,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 11:20:54,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 11:20:54,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 11:20:54,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 11:20:54,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 11:20:54,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:20:54,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 11:20:54,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 11:20:54,268 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 11:20:54,268 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 11:20:54,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 11:20:54,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 11:20:54,268 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 11:20:54,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 11:20:54,268 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 11:20:54,268 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 -> LOOP [2023-05-04 11:20:54,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 11:20:54,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 11:20:54,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 11:20:54,438 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 11:20:54,442 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 11:20:54,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-05-04 11:20:54,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76748d291/48be14de2c1e4b8684397765c8bab7ee/FLAG298763bed [2023-05-04 11:20:54,927 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 11:20:54,927 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-05-04 11:20:54,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76748d291/48be14de2c1e4b8684397765c8bab7ee/FLAG298763bed [2023-05-04 11:20:54,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76748d291/48be14de2c1e4b8684397765c8bab7ee [2023-05-04 11:20:54,956 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 11:20:54,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 11:20:54,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 11:20:54,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 11:20:54,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 11:20:54,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:20:54" (1/1) ... [2023-05-04 11:20:54,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a28d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:54, skipping insertion in model container [2023-05-04 11:20:54,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 11:20:54" (1/1) ... [2023-05-04 11:20:54,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 11:20:54,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 11:20:55,284 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_71-funloop_racing.i[41323,41336] [2023-05-04 11:20:55,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:20:55,311 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 11:20:55,331 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_71-funloop_racing.i[41323,41336] [2023-05-04 11:20:55,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 11:20:55,376 INFO L208 MainTranslator]: Completed translation [2023-05-04 11:20:55,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55 WrapperNode [2023-05-04 11:20:55,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 11:20:55,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 11:20:55,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 11:20:55,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 11:20:55,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,418 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 244 [2023-05-04 11:20:55,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 11:20:55,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 11:20:55,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 11:20:55,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 11:20:55,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 11:20:55,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 11:20:55,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 11:20:55,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 11:20:55,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (1/1) ... [2023-05-04 11:20:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 11:20:55,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:20:55,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 11:20:55,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 11:20:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 11:20:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 11:20:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 11:20:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 11:20:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 11:20:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 11:20:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 11:20:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 11:20:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 11:20:55,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 11:20:55,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 11:20:55,605 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 11:20:55,759 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 11:20:55,761 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 11:20:55,983 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 11:20:55,989 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 11:20:55,990 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2023-05-04 11:20:55,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:20:55 BoogieIcfgContainer [2023-05-04 11:20:55,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 11:20:55,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 11:20:55,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 11:20:55,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 11:20:55,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 11:20:54" (1/3) ... [2023-05-04 11:20:55,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da8cadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:20:55, skipping insertion in model container [2023-05-04 11:20:55,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 11:20:55" (2/3) ... [2023-05-04 11:20:55,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da8cadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 11:20:55, skipping insertion in model container [2023-05-04 11:20:55,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 11:20:55" (3/3) ... [2023-05-04 11:20:55,996 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-05-04 11:20:56,001 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 11:20:56,007 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 11:20:56,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 11:20:56,007 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 11:20:56,122 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 11:20:56,150 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:20:56,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 11:20:56,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:20:56,156 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 11:20:56,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 11:20:56,179 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 11:20:56,190 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 11:20:56,194 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;@4a25daec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 11:20:56,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 11:20:56,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:20:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:20:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash 858981285, now seen corresponding path program 1 times [2023-05-04 11:20:56,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:20:56,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207120532] [2023-05-04 11:20:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:56,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:20:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:56,837 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-05-04 11:20:56,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:20:56,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207120532] [2023-05-04 11:20:56,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207120532] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:20:56,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 11:20:56,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 11:20:56,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282278868] [2023-05-04 11:20:56,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:20:56,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:20:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:20:56,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:20:56,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 11:20:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:56,858 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:20:56,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:20:56,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:56,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:56,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 11:20:56,894 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:20:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:20:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1209805434, now seen corresponding path program 1 times [2023-05-04 11:20:56,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:20:56,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968263493] [2023-05-04 11:20:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:20:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-05-04 11:20:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:20:57,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968263493] [2023-05-04 11:20:57,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968263493] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:20:57,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633606470] [2023-05-04 11:20:57,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:57,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:20:57,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:20:57,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:20:57,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 11:20:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:57,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 11:20:57,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:20:57,300 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-05-04 11:20:57,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 11:20:57,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633606470] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:20:57,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 11:20:57,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 11:20:57,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132450037] [2023-05-04 11:20:57,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:20:57,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:20:57,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:20:57,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:20:57,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 11:20:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:57,303 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:20:57,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:20:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:57,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:57,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 11:20:57,668 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-04 11:20:57,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:20:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:20:57,669 INFO L85 PathProgramCache]: Analyzing trace with hash 859300382, now seen corresponding path program 1 times [2023-05-04 11:20:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:20:57,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964530695] [2023-05-04 11:20:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:20:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 11:20:57,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:20:57,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964530695] [2023-05-04 11:20:57,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964530695] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:20:57,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353626975] [2023-05-04 11:20:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:57,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:20:57,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:20:57,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:20:57,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 11:20:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:58,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 11:20:58,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:20:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-05-04 11:20:58,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 11:20:58,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353626975] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 11:20:58,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 11:20:58,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 11:20:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852569496] [2023-05-04 11:20:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 11:20:58,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 11:20:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:20:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 11:20:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 11:20:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:58,079 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:20:58,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:20:58,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,080 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,137 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-04 11:20:58,323 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-04 11:20:58,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:20:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:20:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2143987624, now seen corresponding path program 1 times [2023-05-04 11:20:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:20:58,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173222772] [2023-05-04 11:20:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:20:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 11:20:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:20:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173222772] [2023-05-04 11:20:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173222772] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:20:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593173151] [2023-05-04 11:20:58,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:58,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:20:58,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:20:58,457 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:20:58,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 11:20:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:58,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 11:20:58,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:20:58,635 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 11:20:58,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:20:58,662 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 11:20:58,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593173151] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:20:58,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:20:58,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 11:20:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078130900] [2023-05-04 11:20:58,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:20:58,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 11:20:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:20:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 11:20:58,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 11:20:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:58,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:20:58,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:20:58,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:58,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:20:58,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 11:20:58,931 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-04 11:20:58,932 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:20:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:20:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1796862392, now seen corresponding path program 2 times [2023-05-04 11:20:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:20:58,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212866606] [2023-05-04 11:20:58,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:20:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:20:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2023-05-04 11:20:59,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:20:59,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212866606] [2023-05-04 11:20:59,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212866606] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:20:59,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942819416] [2023-05-04 11:20:59,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:20:59,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:20:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:20:59,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:20:59,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 11:20:59,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:20:59,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:20:59,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 11:20:59,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:20:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 11:20:59,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:20:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-05-04 11:20:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942819416] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:20:59,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:20:59,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 11:20:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452487245] [2023-05-04 11:20:59,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:20:59,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 11:20:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:20:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 11:20:59,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 11:20:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:59,366 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:20:59,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.368421052631579) internal successors, (216), 19 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:20:59,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:59,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:59,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:59,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:20:59,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:20:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:20:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:20:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:20:59,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 11:20:59,780 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-04 11:20:59,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:20:59,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:20:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash 448232924, now seen corresponding path program 1 times [2023-05-04 11:20:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:20:59,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332403697] [2023-05-04 11:20:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:20:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:20:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:21:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 11:21:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:21:00,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332403697] [2023-05-04 11:21:00,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332403697] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:21:00,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798271234] [2023-05-04 11:21:00,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:21:00,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:21:00,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:21:00,053 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:21:00,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 11:21:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:21:00,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 11:21:00,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:21:00,219 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 11:21:00,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:21:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 11:21:00,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798271234] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:21:00,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:21:00,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 11:21:00,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542370211] [2023-05-04 11:21:00,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:21:00,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 11:21:00,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:21:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 11:21:00,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 11:21:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:21:00,385 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:21:00,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:21:00,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:00,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:00,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:00,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:21:00,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:21:00,386 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:21:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:21:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:21:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:21:00,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 11:21:00,881 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-04 11:21:00,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:21:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:21:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1987688597, now seen corresponding path program 2 times [2023-05-04 11:21:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:21:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439165986] [2023-05-04 11:21:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:21:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:21:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:21:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 11:21:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:21:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439165986] [2023-05-04 11:21:01,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439165986] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:21:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412186780] [2023-05-04 11:21:01,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:21:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:21:01,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:21:01,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:21:01,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 11:21:01,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:21:01,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:21:01,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjunts are in the unsatisfiable core [2023-05-04 11:21:01,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:21:01,442 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-04 11:21:01,680 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:21:01,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:21:01,710 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-04 11:21:01,804 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-04 11:21:01,830 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 14 treesize of output 10 [2023-05-04 11:21:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 11:21:01,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:21:09,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_797) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 11:21:11,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_797) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 11:21:11,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_797 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_797) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 11:21:12,284 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 9 treesize of output 7 [2023-05-04 11:21:12,304 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:21:12,304 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-04 11:21:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2023-05-04 11:21:12,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412186780] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:21:12,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:21:12,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2023-05-04 11:21:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138435356] [2023-05-04 11:21:12,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:21:12,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 11:21:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:21:12,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 11:21:12,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=361, Unknown=6, NotChecked=120, Total=552 [2023-05-04 11:21:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:21:12,308 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:21:12,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:21:12,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:12,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:12,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:12,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:21:12,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:21:12,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:21:12,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:21:20,370 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:21:26,446 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 25 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:21:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:21:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:21:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:21:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 11:21:26,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 11:21:26,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:21:26,773 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:21:26,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:21:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1895710326, now seen corresponding path program 1 times [2023-05-04 11:21:26,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:21:26,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204116261] [2023-05-04 11:21:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:21:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:21:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:21:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 11:21:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:21:28,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204116261] [2023-05-04 11:21:28,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204116261] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:21:28,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554329078] [2023-05-04 11:21:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:21:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:21:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:21:28,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:21:28,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 11:21:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:21:28,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-04 11:21:28,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:21:28,207 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-04 11:21:28,472 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:21:28,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:21:28,514 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-04 11:21:28,614 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-04 11:21:28,826 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 14 treesize of output 10 [2023-05-04 11:21:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2023-05-04 11:21:28,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:21:33,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2023-05-04 11:21:33,427 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 9 treesize of output 7 [2023-05-04 11:21:33,451 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:21:33,451 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-04 11:21:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 239 trivial. 8 not checked. [2023-05-04 11:21:33,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554329078] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:21:33,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:21:33,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 40 [2023-05-04 11:21:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537025162] [2023-05-04 11:21:33,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:21:33,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 11:21:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:21:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 11:21:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1320, Unknown=3, NotChecked=74, Total=1560 [2023-05-04 11:21:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:21:33,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:21:33,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.5) internal successors, (260), 40 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:21:33,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:33,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:33,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:21:33,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:21:33,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:21:33,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:21:33,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 11:21:33,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:21:45,637 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 32 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:21:51,680 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 36 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:22:07,765 WARN L233 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 39 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:22:25,827 WARN L233 SmtUtils]: Spent 18.04s on a formula simplification. DAG size of input: 49 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:22:41,969 WARN L233 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 43 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:22:58,107 WARN L233 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 46 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 11:22:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 11:22:59,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-05-04 11:22:59,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-05-04 11:22:59,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:22:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:22:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1451161014, now seen corresponding path program 1 times [2023-05-04 11:22:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:22:59,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926390323] [2023-05-04 11:22:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:22:59,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:22:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:23:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 10 proven. 98 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 11:23:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:23:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926390323] [2023-05-04 11:23:01,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926390323] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:23:01,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934006668] [2023-05-04 11:23:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:23:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:23:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:23:01,967 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:23:01,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 11:23:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:23:02,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 45 conjunts are in the unsatisfiable core [2023-05-04 11:23:02,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:23:02,150 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-04 11:23:02,435 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:23:02,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:23:02,487 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-04 11:23:02,591 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-04 11:23:02,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-04 11:23:03,024 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-04 11:23:13,779 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-04 11:23:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-05-04 11:23:13,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:23:19,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0))) is different from false [2023-05-04 11:23:21,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ (* |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_51|) 0))) is different from false [2023-05-04 11:23:23,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1010 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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_1010)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0))) is different from false [2023-05-04 11:23:25,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1010 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int)) (or (= (select (select (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_53| v_ArrVal_1010)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2023-05-04 11:23:29,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1010 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1007) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1010) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0))) is different from false [2023-05-04 11:23:30,563 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:23:30,565 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 9 treesize of output 7 [2023-05-04 11:23:30,600 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:23:30,600 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-04 11:23:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 260 trivial. 46 not checked. [2023-05-04 11:23:30,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934006668] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:23:30,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:23:30,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 19] total 58 [2023-05-04 11:23:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720366599] [2023-05-04 11:23:30,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:23:30,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-04 11:23:30,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:23:30,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-04 11:23:30,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2465, Unknown=18, NotChecked=530, Total=3306 [2023-05-04 11:23:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:23:30,609 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:23:30,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.0) internal successors, (406), 58 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 11:23:30,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:24:09,921 WARN L233 SmtUtils]: Spent 20.39s on a formula simplification. DAG size of input: 89 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:24:30,562 WARN L233 SmtUtils]: Spent 20.55s on a formula simplification. DAG size of input: 107 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:24:44,178 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification. DAG size of input: 96 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:25:04,901 WARN L233 SmtUtils]: Spent 20.66s on a formula simplification. DAG size of input: 87 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:27:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:27:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:27:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:27:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:27:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:27:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:27:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 11:27:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 11:27:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-05-04 11:27:36,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 11:27:36,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:27:36,370 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 11:27:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 11:27:36,371 INFO L85 PathProgramCache]: Analyzing trace with hash -638813311, now seen corresponding path program 2 times [2023-05-04 11:27:36,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 11:27:36,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709589432] [2023-05-04 11:27:36,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 11:27:36,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 11:27:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 11:27:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 30 proven. 389 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 11:27:50,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 11:27:50,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709589432] [2023-05-04 11:27:50,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709589432] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 11:27:50,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54693876] [2023-05-04 11:27:50,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 11:27:50,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 11:27:50,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 11:27:50,400 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 11:27:50,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 11:27:50,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 11:27:50,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 11:27:50,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-04 11:27:50,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 11:27:50,703 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-04 11:27:50,977 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 11:27:50,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 11:27:51,022 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-04 11:27:51,185 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-04 11:27:51,605 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-04 11:27:51,724 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-04 11:28:31,746 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-04 11:28:34,230 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-04 11:31:00,827 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 20 treesize of output 16 [2023-05-04 11:31:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 36 proven. 370 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-05-04 11:31:00,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 11:31:07,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0))) is different from false [2023-05-04 11:31:08,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 11:31:11,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-04 11:31:12,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-05-04 11:31:15,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_1211 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (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_1211)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0))) is different from false [2023-05-04 11:31:17,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (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_66| v_ArrVal_1211)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2023-05-04 11:31:19,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1211) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 11:32:01,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1211) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 11:32:04,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1211) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 11:32:06,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1211) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 11:32:08,243 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (= (select (store (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_1207)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1211) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 11:32:10,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int) (|v_t_funThread1of1ForFork0_~i~0#1_47| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_47| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_47| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 .cse0 |c_~#cache~0.offset|)) (= (select (store (select (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_70| v_ArrVal_1207)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1211) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)))) is different from false [2023-05-04 11:32:19,219 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| Int) (v_ArrVal_1204 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (v_ArrVal_1211 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1207 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1204))) (or (= (select (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70| v_ArrVal_1207) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_1211) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0) (not (= (select (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_70|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|))))) is different from false [2023-05-04 11:32:20,641 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:32:20,641 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 11:32:20,647 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:32:20,660 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 33 treesize of output 32 [2023-05-04 11:32:20,716 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 11:32:20,716 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-04 11:32:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 9 proven. 50 refuted. 2 times theorem prover too weak. 248 trivial. 345 not checked. [2023-05-04 11:32:20,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54693876] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 11:32:20,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 11:32:20,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 32] total 94 [2023-05-04 11:32:20,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204121896] [2023-05-04 11:32:20,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 11:32:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-05-04 11:32:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 11:32:20,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-05-04 11:32:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=5808, Unknown=153, NotChecked=2210, Total=8742 [2023-05-04 11:32:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:32:20,745 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 11:32:20,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 7.468085106382978) internal successors, (702), 94 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-05-04 11:32:20,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 11:34:06,595 WARN L233 SmtUtils]: Spent 17.86s on a formula simplification. DAG size of input: 142 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 11:34:39,155 WARN L233 SmtUtils]: Spent 18.93s on a formula simplification. DAG size of input: 140 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 11:35:32,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:35:32,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:35:32,959 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 11:35:34,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 11:35:34,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 11:35:34,177 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-05-04 11:35:34,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 11:35:34,196 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:219) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:203) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:154) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.automata.partialorder.PersistentSetReduction.applyNewStateReduction(PersistentSetReduction.java:73) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-05-04 11:35:34,199 INFO L158 Benchmark]: Toolchain (without parser) took 879241.98ms. Allocated memory was 191.9MB in the beginning and 773.8MB in the end (delta: 582.0MB). Free memory was 133.9MB in the beginning and 637.6MB in the end (delta: -503.8MB). Peak memory consumption was 79.0MB. Max. memory is 8.0GB. [2023-05-04 11:35:34,200 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 191.9MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 11:35:34,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.40ms. Allocated memory is still 191.9MB. Free memory was 133.6MB in the beginning and 145.7MB in the end (delta: -12.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2023-05-04 11:35:34,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.79ms. Allocated memory is still 191.9MB. Free memory was 145.7MB in the beginning and 142.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-05-04 11:35:34,200 INFO L158 Benchmark]: Boogie Preprocessor took 22.92ms. Allocated memory is still 191.9MB. Free memory was 142.7MB in the beginning and 140.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 11:35:34,200 INFO L158 Benchmark]: RCFGBuilder took 548.62ms. Allocated memory is still 191.9MB. Free memory was 140.3MB in the beginning and 119.9MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-05-04 11:35:34,200 INFO L158 Benchmark]: TraceAbstraction took 878206.49ms. Allocated memory was 191.9MB in the beginning and 773.8MB in the end (delta: 582.0MB). Free memory was 118.9MB in the beginning and 637.6MB in the end (delta: -518.8MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. [2023-05-04 11:35:34,201 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-05-04 11:35:34,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 191.9MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 417.40ms. Allocated memory is still 191.9MB. Free memory was 133.6MB in the beginning and 145.7MB in the end (delta: -12.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.79ms. Allocated memory is still 191.9MB. Free memory was 145.7MB in the beginning and 142.7MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.92ms. Allocated memory is still 191.9MB. Free memory was 142.7MB in the beginning and 140.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 548.62ms. Allocated memory is still 191.9MB. Free memory was 140.3MB in the beginning and 119.9MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 878206.49ms. Allocated memory was 191.9MB in the beginning and 773.8MB in the end (delta: 582.0MB). Free memory was 118.9MB in the beginning and 637.6MB in the end (delta: -518.8MB). Peak memory consumption was 64.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown