/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 true -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-32214ab [2023-05-19 22:21:45,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-19 22:21:45,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-19 22:21:45,796 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-19 22:21:45,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-19 22:21:45,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-19 22:21:45,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-19 22:21:45,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-19 22:21:45,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-19 22:21:45,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-19 22:21:45,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-19 22:21:45,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-19 22:21:45,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-19 22:21:45,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-19 22:21:45,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-19 22:21:45,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-19 22:21:45,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-19 22:21:45,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-19 22:21:45,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-19 22:21:45,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-19 22:21:45,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-19 22:21:45,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-19 22:21:45,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-19 22:21:45,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-19 22:21:45,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-19 22:21:45,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-19 22:21:45,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-19 22:21:45,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-19 22:21:45,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-19 22:21:45,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-19 22:21:45,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-19 22:21:45,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-19 22:21:45,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-19 22:21:45,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-19 22:21:45,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-19 22:21:45,820 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-19 22:21:45,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-19 22:21:45,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-19 22:21:45,821 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-19 22:21:45,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-19 22:21:45,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-19 22:21:45,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-19 22:21:45,843 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-19 22:21:45,843 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-19 22:21:45,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-19 22:21:45,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-19 22:21:45,844 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-19 22:21:45,844 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-19 22:21:45,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-19 22:21:45,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-19 22:21:45,850 INFO L138 SettingsManager]: * Use SBE=true [2023-05-19 22:21:45,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-19 22:21:45,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-19 22:21:45,852 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-19 22:21:45,852 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-19 22:21:45,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-19 22:21:45,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-19 22:21:45,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 22:21:45,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-19 22:21:45,853 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-19 22:21:45,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-19 22:21:45,853 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-19 22:21:45,854 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-19 22:21:45,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-19 22:21:45,854 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-19 22:21:45,854 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-19 22:21:45,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-19 22:21:45,854 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-19 22:21:45,854 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 -> true [2023-05-19 22:21:46,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-19 22:21:46,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-19 22:21:46,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-19 22:21:46,047 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-19 22:21:46,047 INFO L275 PluginConnector]: CDTParser initialized [2023-05-19 22:21:46,049 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-19 22:21:46,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3392e23/cdda2ac466e344ef9a0041457202536a/FLAGbacfeae89 [2023-05-19 22:21:46,508 INFO L306 CDTParser]: Found 1 translation units. [2023-05-19 22:21:46,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2023-05-19 22:21:46,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3392e23/cdda2ac466e344ef9a0041457202536a/FLAGbacfeae89 [2023-05-19 22:21:46,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d3392e23/cdda2ac466e344ef9a0041457202536a [2023-05-19 22:21:46,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-19 22:21:46,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-19 22:21:46,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-19 22:21:46,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-19 22:21:46,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-19 22:21:46,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.05 10:21:46" (1/1) ... [2023-05-19 22:21:46,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee4bdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:46, skipping insertion in model container [2023-05-19 22:21:46,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.05 10:21:46" (1/1) ... [2023-05-19 22:21:46,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-19 22:21:46,589 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-19 22:21:46,934 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-19 22:21:46,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-19 22:21:46,970 INFO L203 MainTranslator]: Completed pre-run [2023-05-19 22:21:47,000 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-19 22:21:47,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-19 22:21:47,044 INFO L208 MainTranslator]: Completed translation [2023-05-19 22:21:47,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47 WrapperNode [2023-05-19 22:21:47,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-19 22:21:47,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-19 22:21:47,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-19 22:21:47,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-19 22:21:47,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,090 INFO L138 Inliner]: procedures = 271, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 244 [2023-05-19 22:21:47,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-19 22:21:47,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-19 22:21:47,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-19 22:21:47,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-19 22:21:47,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,123 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-19 22:21:47,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-19 22:21:47,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-19 22:21:47,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-19 22:21:47,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (1/1) ... [2023-05-19 22:21:47,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-19 22:21:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:47,160 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-19 22:21:47,161 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-19 22:21:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-19 22:21:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-19 22:21:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-19 22:21:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-19 22:21:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-19 22:21:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-19 22:21:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-19 22:21:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-19 22:21:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-19 22:21:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-19 22:21:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-19 22:21:47,195 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-19 22:21:47,335 INFO L235 CfgBuilder]: Building ICFG [2023-05-19 22:21:47,338 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-19 22:21:47,541 INFO L276 CfgBuilder]: Performing block encoding [2023-05-19 22:21:47,547 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-19 22:21:47,547 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2023-05-19 22:21:47,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 10:21:47 BoogieIcfgContainer [2023-05-19 22:21:47,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-19 22:21:47,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-19 22:21:47,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-19 22:21:47,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-19 22:21:47,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.05 10:21:46" (1/3) ... [2023-05-19 22:21:47,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4172d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.05 10:21:47, skipping insertion in model container [2023-05-19 22:21:47,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.05 10:21:47" (2/3) ... [2023-05-19 22:21:47,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4172d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.05 10:21:47, skipping insertion in model container [2023-05-19 22:21:47,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.05 10:21:47" (3/3) ... [2023-05-19 22:21:47,558 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2023-05-19 22:21:47,563 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-19 22:21:47,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-19 22:21:47,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-19 22:21:47,569 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-19 22:21:47,640 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-19 22:21:47,688 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:21:47,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-19 22:21:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:47,690 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-19 22:21:47,705 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-19 22:21:47,722 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-19 22:21:47,738 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-19 22:21:47,742 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;@765d762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-19 22:21:47,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-19 22:21:48,037 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:21:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:21:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 858981285, now seen corresponding path program 1 times [2023-05-19 22:21:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:21:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276464468] [2023-05-19 22:21:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:21:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:48,410 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-19 22:21:48,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:21:48,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276464468] [2023-05-19 22:21:48,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276464468] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 22:21:48,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-19 22:21:48,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-19 22:21:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400172887] [2023-05-19 22:21:48,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 22:21:48,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 22:21:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:21:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 22:21:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-19 22:21:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:48,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:21:48,451 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-19 22:21:48,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:48,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:48,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-19 22:21:48,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:21:48,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:21:48,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1209805434, now seen corresponding path program 1 times [2023-05-19 22:21:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:21:48,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058675664] [2023-05-19 22:21:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:21:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:48,734 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-19 22:21:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:21:48,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058675664] [2023-05-19 22:21:48,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058675664] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:21:48,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520082272] [2023-05-19 22:21:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:48,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:21:48,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:48,737 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-19 22:21:48,800 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-19 22:21:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:48,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-19 22:21:48,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:21:48,955 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-19 22:21:48,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-19 22:21:48,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520082272] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 22:21:48,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-19 22:21:48,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-19 22:21:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763482555] [2023-05-19 22:21:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 22:21:48,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 22:21:48,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:21:48,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 22:21:48,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-19 22:21:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:48,960 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:21:48,960 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-19 22:21:48,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:48,960 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:49,109 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-19 22:21:49,294 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-19 22:21:49,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:21:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:21:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash 859300382, now seen corresponding path program 1 times [2023-05-19 22:21:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:21:49,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84114570] [2023-05-19 22:21:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:21:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:49,468 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-19 22:21:49,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:21:49,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84114570] [2023-05-19 22:21:49,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84114570] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:21:49,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439747959] [2023-05-19 22:21:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:49,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:21:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:49,477 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-19 22:21:49,500 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-19 22:21:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:49,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-19 22:21:49,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:21:49,661 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-19 22:21:49,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-19 22:21:49,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439747959] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-19 22:21:49,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-19 22:21:49,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-19 22:21:49,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854353831] [2023-05-19 22:21:49,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-19 22:21:49,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-19 22:21:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:21:49,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-19 22:21:49,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-19 22:21:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:49,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:21:49,664 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-19 22:21:49,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:49,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:49,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:49,721 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-19 22:21:49,906 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-19 22:21:49,907 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:21:49,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:21:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2143987624, now seen corresponding path program 1 times [2023-05-19 22:21:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:21:49,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532629646] [2023-05-19 22:21:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:21:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:50,053 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-19 22:21:50,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:21:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532629646] [2023-05-19 22:21:50,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532629646] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:21:50,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349083245] [2023-05-19 22:21:50,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:50,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:21:50,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:50,056 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-19 22:21:50,085 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-19 22:21:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:50,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-19 22:21:50,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:21:50,265 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-19 22:21:50,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:21:50,296 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-19 22:21:50,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349083245] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:21:50,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:21:50,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-19 22:21:50,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808784345] [2023-05-19 22:21:50,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:21:50,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-19 22:21:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:21:50,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-19 22:21:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-19 22:21:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:50,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:21:50,300 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-19 22:21:50,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:50,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:50,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:50,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:50,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:21:50,383 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-19 22:21:50,581 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-19 22:21:50,581 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:21:50,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:21:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1796862392, now seen corresponding path program 2 times [2023-05-19 22:21:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:21:50,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876160960] [2023-05-19 22:21:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:21:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:50,736 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-19 22:21:50,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:21:50,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876160960] [2023-05-19 22:21:50,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876160960] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:21:50,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002929698] [2023-05-19 22:21:50,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:21:50,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:21:50,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:50,738 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-19 22:21:50,761 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-19 22:21:50,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:21:50,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:21:50,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-19 22:21:50,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:21:50,963 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-19 22:21:50,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:21:51,043 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-19 22:21:51,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002929698] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:21:51,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:21:51,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-19 22:21:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392016832] [2023-05-19 22:21:51,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:21:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-19 22:21:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:21:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-19 22:21:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-19 22:21:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:51,046 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:21:51,046 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-19 22:21:51,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:21:51,046 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:21:51,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:21:51,238 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-19 22:21:51,433 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-19 22:21:51,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:21:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:21:51,433 INFO L85 PathProgramCache]: Analyzing trace with hash 448232924, now seen corresponding path program 1 times [2023-05-19 22:21:51,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:21:51,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084144177] [2023-05-19 22:21:51,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:51,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:21:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:51,654 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-19 22:21:51,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:21:51,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084144177] [2023-05-19 22:21:51,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084144177] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:21:51,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701624432] [2023-05-19 22:21:51,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:51,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:21:51,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:51,661 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-19 22:21:51,677 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-19 22:21:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:51,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-19 22:21:51,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:21:51,835 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-19 22:21:51,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:21:51,971 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-19 22:21:51,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701624432] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:21:51,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:21:51,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-19 22:21:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055904806] [2023-05-19 22:21:51,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:21:51,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-19 22:21:51,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:21:51,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-19 22:21:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-19 22:21:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:51,973 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:21:51,973 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-19 22:21:51,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:51,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:21:51,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:21:51,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:21:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:21:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:21:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:21:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:21:52,223 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-19 22:21:52,423 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-19 22:21:52,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:21:52,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:21:52,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1987688597, now seen corresponding path program 2 times [2023-05-19 22:21:52,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:21:52,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804109928] [2023-05-19 22:21:52,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:21:52,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:21:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:21:52,810 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-19 22:21:52,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:21:52,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804109928] [2023-05-19 22:21:52,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804109928] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:21:52,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551728123] [2023-05-19 22:21:52,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:21:52,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:21:52,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:21:52,826 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-19 22:21:52,840 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-19 22:21:52,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:21:52,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:21:52,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjunts are in the unsatisfiable core [2023-05-19 22:21:52,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:21:52,971 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-19 22:21:53,234 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:21:53,235 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-19 22:21:53,267 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-19 22:21:53,367 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-19 22:21:53,398 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-19 22:21:53,433 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-19 22:21:53,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:21:59,519 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-19 22:21:59,545 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-19 22:22:01,557 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-19 22:22:01,966 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-19 22:22:01,988 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:22:01,988 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-19 22:22:01,992 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-19 22:22:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551728123] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:22:01,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:22:01,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2023-05-19 22:22:01,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831992171] [2023-05-19 22:22:01,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:22:01,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-19 22:22:01,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:22:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-19 22:22:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=361, Unknown=6, NotChecked=120, Total=552 [2023-05-19 22:22:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:22:01,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:22:01,994 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-19 22:22:01,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:01,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:01,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:01,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:22:01,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:22:01,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:22:01,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:22:12,150 WARN L233 SmtUtils]: Spent 10.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-19 22:22:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:12,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:22:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:22:12,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:22:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-19 22:22:12,314 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-19 22:22:12,497 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-19 22:22:12,497 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:22:12,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:22:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1895710326, now seen corresponding path program 1 times [2023-05-19 22:22:12,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:22:12,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329216274] [2023-05-19 22:22:12,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:22:12,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:22:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:22:13,836 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-19 22:22:13,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:22:13,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329216274] [2023-05-19 22:22:13,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329216274] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:22:13,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627222160] [2023-05-19 22:22:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:22:13,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:22:13,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:22:13,840 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-19 22:22:13,841 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-19 22:22:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:22:13,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-19 22:22:13,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:22:13,993 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-19 22:22:14,278 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:22:14,278 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-19 22:22:14,321 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-19 22:22:14,447 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-19 22:22:14,626 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-19 22:22:14,672 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-19 22:22:14,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:22:18,849 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-19 22:22:19,150 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-19 22:22:19,179 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:22:19,179 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-19 22:22:19,183 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-19 22:22:19,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627222160] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:22:19,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:22:19,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 40 [2023-05-19 22:22:19,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824772535] [2023-05-19 22:22:19,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:22:19,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-19 22:22:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:22:19,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-19 22:22:19,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1320, Unknown=3, NotChecked=74, Total=1560 [2023-05-19 22:22:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:22:19,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:22:19,186 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-19 22:22:19,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:19,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:19,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:22:19,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:22:19,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:22:19,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:22:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-19 22:22:19,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:22:29,383 WARN L233 SmtUtils]: Spent 10.03s 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-19 22:22:39,434 WARN L233 SmtUtils]: Spent 10.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-19 22:22:51,516 WARN L233 SmtUtils]: Spent 12.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-19 22:23:05,636 WARN L233 SmtUtils]: Spent 14.05s on a formula simplification. DAG size of input: 56 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:23:23,781 WARN L233 SmtUtils]: Spent 18.06s 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-19 22:23:37,869 WARN L233 SmtUtils]: Spent 14.06s on a formula simplification. DAG size of input: 57 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:24:00,005 WARN L233 SmtUtils]: Spent 22.05s 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-19 22:24:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:24:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:24:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:24:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:24:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:24:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:24:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-19 22:24:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-19 22:24:01,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-19 22:24:01,285 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-19 22:24:01,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:24:01,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:24:01,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1451161014, now seen corresponding path program 1 times [2023-05-19 22:24:01,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:24:01,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443939115] [2023-05-19 22:24:01,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:24:01,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:24:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:24:04,703 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-19 22:24:04,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:24:04,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443939115] [2023-05-19 22:24:04,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443939115] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:24:04,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287859919] [2023-05-19 22:24:04,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:24:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:24:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:24:04,708 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-19 22:24:04,708 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-19 22:24:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:24:04,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 45 conjunts are in the unsatisfiable core [2023-05-19 22:24:04,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:24:04,893 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-19 22:24:05,159 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:24:05,159 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-19 22:24:05,204 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-19 22:24:05,317 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-19 22:24:05,684 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-19 22:24:05,790 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-19 22:24:17,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-05-19 22:24:17,604 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-19 22:24:17,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:24:23,733 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-19 22:24:25,694 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-19 22:24:27,737 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-19 22:24:29,843 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-19 22:24:34,232 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-19 22:24:34,907 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-19 22:24:34,909 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-19 22:24:34,943 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:24:34,944 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-19 22:24:34,946 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-19 22:24:34,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287859919] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:24:34,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:24:34,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 19] total 58 [2023-05-19 22:24:34,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043551047] [2023-05-19 22:24:34,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:24:34,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-19 22:24:34,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:24:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-19 22:24:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2465, Unknown=18, NotChecked=530, Total=3306 [2023-05-19 22:24:34,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:24:34,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:24:34,949 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-19 22:24:34,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:24:34,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:24:34,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:24:34,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:24:34,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:24:34,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:24:34,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-19 22:24:34,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-19 22:24:34,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:25:15,880 WARN L233 SmtUtils]: Spent 22.07s 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-19 22:25:48,141 WARN L233 SmtUtils]: Spent 22.78s 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-19 22:26:07,488 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 86 DAG size of output: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:28:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-19 22:28:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-19 22:28:22,300 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-19 22:28:22,493 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-19 22:28:22,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-19 22:28:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-19 22:28:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash -638813311, now seen corresponding path program 2 times [2023-05-19 22:28:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-19 22:28:22,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338161880] [2023-05-19 22:28:22,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-19 22:28:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-19 22:28:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-19 22:28:38,536 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-19 22:28:38,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-19 22:28:38,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338161880] [2023-05-19 22:28:38,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338161880] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-19 22:28:38,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875870198] [2023-05-19 22:28:38,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-19 22:28:38,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-19 22:28:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-19 22:28:38,538 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-19 22:28:38,539 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-19 22:28:38,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-19 22:28:38,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-19 22:28:38,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 63 conjunts are in the unsatisfiable core [2023-05-19 22:28:38,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-19 22:28:38,770 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-19 22:28:39,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-19 22:28:39,059 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-19 22:28:39,108 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-19 22:28:39,246 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-19 22:28:39,654 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-19 22:28:39,770 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-19 22:29:22,467 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-19 22:29:25,077 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-19 22:31:51,184 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-19 22:31:51,290 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-19 22:31:51,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-19 22:31:57,442 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-19 22:31:59,452 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-19 22:32:01,555 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-19 22:32:03,564 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-19 22:32:05,597 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-19 22:32:07,678 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-19 22:32:09,696 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-19 22:32:11,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_47| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_47|)) (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 (* |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_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-19 22:32:13,742 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-19 22:32:16,030 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-19 22:32:18,045 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-19 22:32:20,135 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-19 22:32:22,394 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-19 22:32:28,658 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-19 22:32:28,659 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-19 22:32:28,664 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:32:28,665 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-19 22:32:28,721 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-19 22:32:28,721 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-19 22:32:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 11 proven. 56 refuted. 0 times theorem prover too weak. 248 trivial. 339 not checked. [2023-05-19 22:32:28,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875870198] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-19 22:32:28,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-19 22:32:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34, 32] total 94 [2023-05-19 22:32:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647956257] [2023-05-19 22:32:28,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-19 22:32:28,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-05-19 22:32:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-19 22:32:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-05-19 22:32:28,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=5837, Unknown=144, NotChecked=2210, Total=8742 [2023-05-19 22:32:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:32:28,729 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-19 22:32:28,729 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-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-19 22:32:28,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-19 22:35:00,764 WARN L233 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 62 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:35:11,984 WARN L233 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 71 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:35:31,270 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 68 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:35:43,124 WARN L233 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 100 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-19 22:36:03,240 WARN L233 SmtUtils]: Spent 11.84s on a formula simplification. DAG size of input: 110 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-19 22:36:15,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-19 22:36:15,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-19 22:36:15,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-19 22:36:16,978 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-19 22:36:16,991 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-19 22:36:17,160 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-19 22:36:17,178 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 [2023-05-19 22:36:17,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-19 22:36:17,179 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-19 22:36:17,183 INFO L158 Benchmark]: Toolchain (without parser) took 870639.93ms. Allocated memory was 182.5MB in the beginning and 520.1MB in the end (delta: 337.6MB). Free memory was 155.0MB in the beginning and 189.9MB in the end (delta: -35.0MB). Peak memory consumption was 303.2MB. Max. memory is 8.0GB. [2023-05-19 22:36:17,183 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-19 22:36:17,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.32ms. Allocated memory was 182.5MB in the beginning and 225.4MB in the end (delta: 43.0MB). Free memory was 154.5MB in the beginning and 174.5MB in the end (delta: -20.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-05-19 22:36:17,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.67ms. Allocated memory is still 225.4MB. Free memory was 174.5MB in the beginning and 171.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-05-19 22:36:17,184 INFO L158 Benchmark]: Boogie Preprocessor took 36.00ms. Allocated memory is still 225.4MB. Free memory was 171.5MB in the beginning and 169.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-19 22:36:17,184 INFO L158 Benchmark]: RCFGBuilder took 421.60ms. Allocated memory is still 225.4MB. Free memory was 169.0MB in the beginning and 148.7MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-05-19 22:36:17,184 INFO L158 Benchmark]: TraceAbstraction took 869628.59ms. Allocated memory was 225.4MB in the beginning and 520.1MB in the end (delta: 294.6MB). Free memory was 147.7MB in the beginning and 189.9MB in the end (delta: -42.3MB). Peak memory consumption was 254.0MB. Max. memory is 8.0GB. [2023-05-19 22:36:17,185 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.32ms. Allocated memory was 182.5MB in the beginning and 225.4MB in the end (delta: 43.0MB). Free memory was 154.5MB in the beginning and 174.5MB in the end (delta: -20.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.67ms. Allocated memory is still 225.4MB. Free memory was 174.5MB in the beginning and 171.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.00ms. Allocated memory is still 225.4MB. Free memory was 171.5MB in the beginning and 169.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 421.60ms. Allocated memory is still 225.4MB. Free memory was 169.0MB in the beginning and 148.7MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 869628.59ms. Allocated memory was 225.4MB in the beginning and 520.1MB in the end (delta: 294.6MB). Free memory was 147.7MB in the beginning and 189.9MB in the end (delta: -42.3MB). Peak memory consumption was 254.0MB. 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