/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps X --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 20:05:14,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 20:05:14,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 20:05:14,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 20:05:14,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 20:05:14,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 20:05:14,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 20:05:14,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 20:05:14,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 20:05:14,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 20:05:14,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 20:05:14,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 20:05:14,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 20:05:14,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 20:05:14,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 20:05:14,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 20:05:14,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 20:05:14,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 20:05:14,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 20:05:14,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 20:05:14,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 20:05:14,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 20:05:14,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 20:05:14,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 20:05:14,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 20:05:14,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 20:05:14,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 20:05:14,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 20:05:14,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 20:05:14,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 20:05:14,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 20:05:14,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 20:05:14,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 20:05:14,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 20:05:14,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 20:05:14,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 20:05:14,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 20:05:14,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 20:05:14,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 20:05:14,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 20:05:14,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 20:05:14,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 20:05:14,621 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 20:05:14,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 20:05:14,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 20:05:14,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 20:05:14,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 20:05:14,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 20:05:14,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 20:05:14,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 20:05:14,623 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 20:05:14,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 20:05:14,623 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 20:05:14,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 20:05:14,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 20:05:14,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 20:05:14,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 20:05:14,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:05:14,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 20:05:14,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 20:05:14,626 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 20:05:14,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 20:05:14,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 20:05:14,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 20:05:14,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 20:05:14,836 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 20:05:14,838 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 20:05:14,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-05-04 20:05:14,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f790be7e/6456a91f0f044ae2b6b36ef8a9861834/FLAG07755c540 [2023-05-04 20:05:15,348 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 20:05:15,349 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-05-04 20:05:15,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f790be7e/6456a91f0f044ae2b6b36ef8a9861834/FLAG07755c540 [2023-05-04 20:05:15,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f790be7e/6456a91f0f044ae2b6b36ef8a9861834 [2023-05-04 20:05:15,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 20:05:15,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 20:05:15,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 20:05:15,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 20:05:15,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 20:05:15,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfffe64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15, skipping insertion in model container [2023-05-04 20:05:15,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 20:05:15,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 20:05:15,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2023-05-04 20:05:15,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:05:15,800 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 20:05:15,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2023-05-04 20:05:15,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 20:05:15,888 INFO L208 MainTranslator]: Completed translation [2023-05-04 20:05:15,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15 WrapperNode [2023-05-04 20:05:15,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 20:05:15,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 20:05:15,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 20:05:15,890 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 20:05:15,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,937 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2023-05-04 20:05:15,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 20:05:15,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 20:05:15,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 20:05:15,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 20:05:15,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,964 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 20:05:15,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 20:05:15,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 20:05:15,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 20:05:15,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (1/1) ... [2023-05-04 20:05:15,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 20:05:15,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:16,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-04 20:05:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 20:05:16,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 20:05:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 20:05:16,047 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 20:05:16,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 20:05:16,170 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 20:05:16,172 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 20:05:16,434 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 20:05:16,440 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 20:05:16,440 INFO L300 CfgBuilder]: Removed 25 assume(true) statements. [2023-05-04 20:05:16,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:05:16 BoogieIcfgContainer [2023-05-04 20:05:16,442 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 20:05:16,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 20:05:16,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 20:05:16,447 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 20:05:16,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 08:05:15" (1/3) ... [2023-05-04 20:05:16,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b00c798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:05:16, skipping insertion in model container [2023-05-04 20:05:16,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 08:05:15" (2/3) ... [2023-05-04 20:05:16,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b00c798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 08:05:16, skipping insertion in model container [2023-05-04 20:05:16,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 08:05:16" (3/3) ... [2023-05-04 20:05:16,449 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2023-05-04 20:05:16,454 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 20:05:16,464 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 20:05:16,464 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-04 20:05:16,464 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 20:05:16,542 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-04 20:05:16,579 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:05:16,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 20:05:16,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:16,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 20:05:16,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 20:05:16,607 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 20:05:16,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-04 20:05:16,632 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;@50074032, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 20:05:16,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 20:05:16,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1236610443, now seen corresponding path program 1 times [2023-05-04 20:05:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:16,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205159725] [2023-05-04 20:05:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 20:05:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:17,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205159725] [2023-05-04 20:05:17,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205159725] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:05:17,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 20:05:17,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 20:05:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966126850] [2023-05-04 20:05:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:05:17,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 20:05:17,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 20:05:17,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 20:05:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:17,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:17,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:17,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:17,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:17,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 20:05:17,166 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:17,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash -72680252, now seen corresponding path program 1 times [2023-05-04 20:05:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:17,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334516503] [2023-05-04 20:05:17,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 20:05:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:17,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334516503] [2023-05-04 20:05:17,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334516503] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:17,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697577613] [2023-05-04 20:05:17,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:17,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:17,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:17,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:17,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 20:05:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:17,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 20:05:17,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-04 20:05:17,554 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 20:05:17,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697577613] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:05:17,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 20:05:17,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 20:05:17,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690475315] [2023-05-04 20:05:17,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:05:17,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 20:05:17,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:17,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 20:05:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 20:05:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:17,557 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:17,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:17,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:17,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:17,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:17,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 20:05:17,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-04 20:05:17,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:17,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:17,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1694732592, now seen corresponding path program 1 times [2023-05-04 20:05:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:17,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243199756] [2023-05-04 20:05:17,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:17,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:18,134 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 20:05:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:18,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243199756] [2023-05-04 20:05:18,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243199756] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:18,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044519530] [2023-05-04 20:05:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:18,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:18,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:18,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:18,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-04 20:05:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:18,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2023-05-04 20:05:18,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-04 20:05:18,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-04 20:05:18,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044519530] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 20:05:18,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-04 20:05:18,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-05-04 20:05:18,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89826873] [2023-05-04 20:05:18,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 20:05:18,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 20:05:18,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:18,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 20:05:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-04 20:05:18,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:18,330 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:18,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:18,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 20:05:18,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:18,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:18,574 INFO L85 PathProgramCache]: Analyzing trace with hash -192986773, now seen corresponding path program 1 times [2023-05-04 20:05:18,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:18,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713607683] [2023-05-04 20:05:18,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:18,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 20:05:18,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:18,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713607683] [2023-05-04 20:05:18,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713607683] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:18,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982347513] [2023-05-04 20:05:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:18,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:18,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:18,720 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:18,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 20:05:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:18,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 20:05:18,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 20:05:18,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:05:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 20:05:18,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982347513] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:05:18,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:05:18,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 20:05:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894210828] [2023-05-04 20:05:18,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:05:18,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 20:05:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:18,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 20:05:18,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 20:05:18,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:18,929 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:18,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.6) internal successors, (146), 10 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:18,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:19,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 20:05:19,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:19,198 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 576278763, now seen corresponding path program 2 times [2023-05-04 20:05:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:19,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075540468] [2023-05-04 20:05:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-05-04 20:05:19,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:19,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075540468] [2023-05-04 20:05:19,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075540468] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:19,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144569164] [2023-05-04 20:05:19,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 20:05:19,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:19,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:19,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:19,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-04 20:05:19,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 20:05:19,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:05:19,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-04 20:05:19,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 20:05:19,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:05:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-05-04 20:05:19,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144569164] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:05:19,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:05:19,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-04 20:05:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088544347] [2023-05-04 20:05:19,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:05:19,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 20:05:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:19,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 20:05:19,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-04 20:05:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:19,667 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:19,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 10.105263157894736) internal successors, (192), 19 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:19,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:19,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:19,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:19,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:19,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:19,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:05:19,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-04 20:05:20,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:20,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:20,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:20,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1933269720, now seen corresponding path program 1 times [2023-05-04 20:05:20,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:20,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326089293] [2023-05-04 20:05:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:20,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 20:05:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:20,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326089293] [2023-05-04 20:05:20,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326089293] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:20,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977062722] [2023-05-04 20:05:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:20,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:20,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:20,288 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:20,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-04 20:05:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:20,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-04 20:05:20,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 20:05:20,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:05:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-04 20:05:20,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977062722] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:05:20,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:05:20,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-04 20:05:20,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037140831] [2023-05-04 20:05:20,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:05:20,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-04 20:05:20,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:20,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-04 20:05:20,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-04 20:05:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:20,628 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:20,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:20,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:20,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:20,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:20,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:20,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:05:20,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:05:20,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:05:20,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-04 20:05:21,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:21,069 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:21,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:21,070 INFO L85 PathProgramCache]: Analyzing trace with hash -864213620, now seen corresponding path program 2 times [2023-05-04 20:05:21,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:21,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611587212] [2023-05-04 20:05:21,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:05:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611587212] [2023-05-04 20:05:21,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611587212] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168293045] [2023-05-04 20:05:21,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 20:05:21,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:21,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:21,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-04 20:05:21,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 20:05:21,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:05:21,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 22 conjunts are in the unsatisfiable core [2023-05-04 20:05:21,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:21,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 20:05:21,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:05:21,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 20:05:21,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:05:22,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:05:22,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-05-04 20:05:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:05:22,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:05:30,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_545) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 20:05:30,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_545) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 20:05:30,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_545) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-05-04 20:05:30,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 20:05:30,656 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:05:30,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 20:05:30,660 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2023-05-04 20:05:30,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168293045] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:05:30,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:05:30,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2023-05-04 20:05:30,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645997852] [2023-05-04 20:05:30,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:05:30,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-04 20:05:30,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:30,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-04 20:05:30,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=361, Unknown=6, NotChecked=120, Total=552 [2023-05-04 20:05:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:30,662 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:30,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.666666666666667) internal successors, (160), 24 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:30,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:30,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:30,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:30,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:30,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:05:30,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:05:30,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:05:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:05:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 20:05:34,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-04 20:05:35,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:35,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:35,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1671128341, now seen corresponding path program 1 times [2023-05-04 20:05:35,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:35,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528442621] [2023-05-04 20:05:35,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:05:36,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:36,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528442621] [2023-05-04 20:05:36,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528442621] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:36,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170454467] [2023-05-04 20:05:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:36,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:36,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:36,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:36,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-04 20:05:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:36,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjunts are in the unsatisfiable core [2023-05-04 20:05:36,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:36,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 20:05:36,966 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:05:36,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 20:05:37,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:05:37,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:05:37,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-05-04 20:05:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2023-05-04 20:05:37,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:05:43,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (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_626) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2023-05-04 20:05:43,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 20:05:43,917 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:05:43,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 20:05:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 239 trivial. 8 not checked. [2023-05-04 20:05:43,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170454467] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:05:43,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:05:43,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 40 [2023-05-04 20:05:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270500066] [2023-05-04 20:05:43,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:05:43,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-04 20:05:43,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:05:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-04 20:05:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1320, Unknown=3, NotChecked=74, Total=1560 [2023-05-04 20:05:43,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:43,921 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:05:43,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.5) internal successors, (260), 40 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 20:05:43,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 20:05:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:05:45,205 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-04 20:05:45,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-05-04 20:05:45,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:05:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:05:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash -865961193, now seen corresponding path program 1 times [2023-05-04 20:05:45,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:05:45,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148222165] [2023-05-04 20:05:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:45,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:05:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 10 proven. 98 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:05:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:05:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148222165] [2023-05-04 20:05:48,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148222165] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:05:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062048332] [2023-05-04 20:05:48,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:05:48,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:05:48,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:05:48,295 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:05:48,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-05-04 20:05:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:05:48,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 45 conjunts are in the unsatisfiable core [2023-05-04 20:05:48,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:05:48,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 20:05:48,715 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:05:48,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 20:05:48,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:05:48,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:05:49,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-04 20:05:49,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-05-04 20:06:00,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-05-04 20:06:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 11 proven. 72 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-05-04 20:06:00,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:06:06,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-04 20:06:07,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:06:10,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_759 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_759)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:06:12,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_759 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (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_49| v_ArrVal_759)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2023-05-04 20:06:16,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_755 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_759 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_755) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_759) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| 28)))) is different from false [2023-05-04 20:06:17,100 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:06:17,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 20:06:17,148 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:06:17,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 20:06:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 260 trivial. 46 not checked. [2023-05-04 20:06:17,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062048332] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:06:17,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:06:17,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21, 19] total 58 [2023-05-04 20:06:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045098921] [2023-05-04 20:06:17,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:06:17,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-04 20:06:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:06:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-04 20:06:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2465, Unknown=18, NotChecked=530, Total=3306 [2023-05-04 20:06:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:06:17,157 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:06:17,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 7.0) internal successors, (406), 58 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:06:17,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:06:41,813 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 107 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:07:06,006 WARN L233 SmtUtils]: Spent 16.43s on a formula simplification. DAG size of input: 87 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:07:29,243 WARN L233 SmtUtils]: Spent 16.25s on a formula simplification. DAG size of input: 107 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:09:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:09:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:09:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:09:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:09:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-05-04 20:09:52,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:09:52,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-05-04 20:09:52,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-05-04 20:09:52,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:09:52,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 20:09:52,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 20:09:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash -51689438, now seen corresponding path program 2 times [2023-05-04 20:09:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 20:09:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710871326] [2023-05-04 20:09:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 20:09:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 20:09:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 20:10:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 30 proven. 389 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-04 20:10:08,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 20:10:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710871326] [2023-05-04 20:10:08,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710871326] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 20:10:08,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707329703] [2023-05-04 20:10:08,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-04 20:10:08,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 20:10:08,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 20:10:08,585 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 20:10:08,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-05-04 20:10:08,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-04 20:10:08,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-04 20:10:08,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 61 conjunts are in the unsatisfiable core [2023-05-04 20:10:08,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 20:10:08,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-04 20:10:09,062 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 20:10:09,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 20:10:09,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:10:09,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-04 20:10:09,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-05-04 20:10:09,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-05-04 20:10:36,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-05-04 20:10:39,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-05-04 20:12:12,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-05-04 20:12:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 32 proven. 359 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2023-05-04 20:12:12,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 20:12:18,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2023-05-04 20:12:20,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:12:27,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 |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_58|) 0))) is different from false [2023-05-04 20:12:29,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:12:31,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_960)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:12:33,271 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 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_62| v_ArrVal_960)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-05-04 20:12:35,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_960) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 .cse0 |c_~#cache~0.offset|))))) is different from false [2023-05-04 20:13:43,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_62| v_ArrVal_960) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-04 20:13:45,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_62| v_ArrVal_960) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-04 20:13:47,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 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_62| v_ArrVal_960) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-04 20:13:48,541 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_955 Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_955)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_960) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-04 20:13:50,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_955 Int) (|v_t_funThread1of1ForFork0_~i~0#1_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_45| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 .cse0 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_45| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (= (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_66| v_ArrVal_955)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_960) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-04 20:14:03,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_952 (Array Int Int)) (v_ArrVal_960 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_955 Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_952) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66| v_ArrVal_955) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| v_ArrVal_960) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 112 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_66|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|)))) is different from false [2023-05-04 20:14:04,215 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:14:04,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 20:14:04,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-05-04 20:14:04,266 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 20:14:04,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-04 20:14:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 263 trivial. 346 not checked. [2023-05-04 20:14:04,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707329703] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 20:14:04,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 20:14:04,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31, 28] total 87 [2023-05-04 20:14:04,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591436459] [2023-05-04 20:14:04,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 20:14:04,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2023-05-04 20:14:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 20:14:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2023-05-04 20:14:04,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=4798, Unknown=117, NotChecked=2028, Total=7482 [2023-05-04 20:14:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:14:04,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 20:14:04,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 7.747126436781609) internal successors, (674), 87 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2023-05-04 20:14:04,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 20:14:53,969 WARN L233 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 49 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:15:21,187 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 52 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:15:41,742 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 80 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:16:05,980 WARN L233 SmtUtils]: Spent 12.57s on a formula simplification. DAG size of input: 139 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:16:23,090 WARN L233 SmtUtils]: Spent 10.92s on a formula simplification. DAG size of input: 149 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:16:50,258 WARN L233 SmtUtils]: Spent 12.73s on a formula simplification. DAG size of input: 130 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:17:09,145 WARN L233 SmtUtils]: Spent 12.71s on a formula simplification. DAG size of input: 138 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:17:45,837 WARN L233 SmtUtils]: Spent 14.50s on a formula simplification. DAG size of input: 150 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:19:09,791 WARN L233 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 78 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-04 20:19:40,947 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 115 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-05-04 20:19:45,791 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 20:19:45,791 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 20:19:45,791 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 20:19:46,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 20:19:46,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-05-04 20:19:46,997 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-05-04 20:19:47,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 20:19:47,016 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-05-04 20:19:47,018 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 20:19:47,020 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-04 20:19:47,021 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1] [2023-05-04 20:19:47,022 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2023-05-04 20:19:47,023 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 20:19:47,023 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 20:19:47,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 08:19:47 BasicIcfg [2023-05-04 20:19:47,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 20:19:47,025 INFO L158 Benchmark]: Toolchain (without parser) took 871638.11ms. Allocated memory was 179.3MB in the beginning and 379.6MB in the end (delta: 200.3MB). Free memory was 144.8MB in the beginning and 112.3MB in the end (delta: 32.5MB). Peak memory consumption was 232.8MB. Max. memory is 8.0GB. [2023-05-04 20:19:47,025 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 20:19:47,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.28ms. Allocated memory was 179.3MB in the beginning and 300.9MB in the end (delta: 121.6MB). Free memory was 144.4MB in the beginning and 252.0MB in the end (delta: -107.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-05-04 20:19:47,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.11ms. Allocated memory is still 300.9MB. Free memory was 252.0MB in the beginning and 248.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 20:19:47,026 INFO L158 Benchmark]: Boogie Preprocessor took 40.29ms. Allocated memory is still 300.9MB. Free memory was 248.8MB in the beginning and 246.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 20:19:47,026 INFO L158 Benchmark]: RCFGBuilder took 463.72ms. Allocated memory is still 300.9MB. Free memory was 246.7MB in the beginning and 227.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-05-04 20:19:47,026 INFO L158 Benchmark]: TraceAbstraction took 870581.02ms. Allocated memory was 300.9MB in the beginning and 379.6MB in the end (delta: 78.6MB). Free memory was 226.8MB in the beginning and 112.3MB in the end (delta: 114.5MB). Peak memory consumption was 194.7MB. Max. memory is 8.0GB. [2023-05-04 20:19:47,027 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.10ms. Allocated memory is still 179.3MB. Free memory is still 133.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.28ms. Allocated memory was 179.3MB in the beginning and 300.9MB in the end (delta: 121.6MB). Free memory was 144.4MB in the beginning and 252.0MB in the end (delta: -107.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.11ms. Allocated memory is still 300.9MB. Free memory was 252.0MB in the beginning and 248.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.29ms. Allocated memory is still 300.9MB. Free memory was 248.8MB in the beginning and 246.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 463.72ms. Allocated memory is still 300.9MB. Free memory was 246.7MB in the beginning and 227.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 870581.02ms. Allocated memory was 300.9MB in the beginning and 379.6MB in the end (delta: 78.6MB). Free memory was 226.8MB in the beginning and 112.3MB in the end (delta: 114.5MB). Peak memory consumption was 194.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12164, independent: 10899, independent conditional: 1382, independent unconditional: 9517, dependent: 1265, dependent conditional: 1238, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10932, independent: 10899, independent conditional: 1382, independent unconditional: 9517, dependent: 33, dependent conditional: 6, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10932, independent: 10899, independent conditional: 1382, independent unconditional: 9517, dependent: 33, dependent conditional: 6, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10938, independent: 10899, independent conditional: 0, independent unconditional: 10899, dependent: 39, dependent conditional: 6, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10938, independent: 10899, independent conditional: 0, independent unconditional: 10899, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10938, independent: 10899, independent conditional: 0, independent unconditional: 10899, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7849, independent: 7822, independent conditional: 0, independent unconditional: 7822, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7849, independent: 7807, independent conditional: 0, independent unconditional: 7807, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 154, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10938, independent: 3077, independent conditional: 0, independent unconditional: 3077, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 7849, unknown conditional: 0, unknown unconditional: 7849] , Statistics on independence cache: Total cache size (in pairs): 7849, Positive cache size: 7822, Positive conditional cache size: 0, Positive unconditional cache size: 7822, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1, Independence queries for same thread: 1232 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 293, Number of trivial persistent sets: 256, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9544, independent: 9517, independent conditional: 0, independent unconditional: 9517, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 12164, independent: 10899, independent conditional: 1382, independent unconditional: 9517, dependent: 1265, dependent conditional: 1238, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10932, independent: 10899, independent conditional: 1382, independent unconditional: 9517, dependent: 33, dependent conditional: 6, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10932, independent: 10899, independent conditional: 1382, independent unconditional: 9517, dependent: 33, dependent conditional: 6, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10938, independent: 10899, independent conditional: 0, independent unconditional: 10899, dependent: 39, dependent conditional: 6, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10938, independent: 10899, independent conditional: 0, independent unconditional: 10899, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10938, independent: 10899, independent conditional: 0, independent unconditional: 10899, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7849, independent: 7822, independent conditional: 0, independent unconditional: 7822, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7849, independent: 7807, independent conditional: 0, independent unconditional: 7807, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 154, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10938, independent: 3077, independent conditional: 0, independent unconditional: 3077, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 7849, unknown conditional: 0, unknown unconditional: 7849] , Statistics on independence cache: Total cache size (in pairs): 7849, Positive cache size: 7822, Positive conditional cache size: 0, Positive unconditional cache size: 7822, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 1, Independence queries for same thread: 1232 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 226 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 870.4s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 564.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 199, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 302.8s InterpolantComputationTime, 3116 NumberOfCodeBlocks, 3116 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4315 ConstructedInterpolants, 834 QuantifiedInterpolants, 149950 SizeOfPredicates, 114 NumberOfNonLiveVariables, 3478 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 3522/5368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown