/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 04:28:59,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 04:28:59,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 04:29:00,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 04:29:00,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 04:29:00,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 04:29:00,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 04:29:00,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 04:29:00,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 04:29:00,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 04:29:00,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 04:29:00,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 04:29:00,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 04:29:00,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 04:29:00,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 04:29:00,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 04:29:00,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 04:29:00,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 04:29:00,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 04:29:00,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 04:29:00,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 04:29:00,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 04:29:00,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 04:29:00,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 04:29:00,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 04:29:00,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 04:29:00,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 04:29:00,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 04:29:00,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 04:29:00,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 04:29:00,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 04:29:00,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 04:29:00,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 04:29:00,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 04:29:00,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 04:29:00,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 04:29:00,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 04:29:00,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 04:29:00,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 04:29:00,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 04:29:00,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 04:29:00,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 04:29:00,055 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 04:29:00,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 04:29:00,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 04:29:00,056 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 04:29:00,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 04:29:00,059 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 04:29:00,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 04:29:00,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 04:29:00,059 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 04:29:00,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 04:29:00,060 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 04:29:00,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 04:29:00,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 04:29:00,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 04:29:00,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 04:29:00,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 04:29:00,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 04:29:00,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 04:29:00,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 04:29:00,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 04:29:00,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 04:29:00,064 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-20 04:29:00,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 04:29:00,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 04:29:00,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 04:29:00,264 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 04:29:00,265 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 04:29:00,266 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-05-20 04:29:00,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8129d3e/2087c544779e46d59bf690a2b0d37bcd/FLAG9ddd6e378 [2023-05-20 04:29:00,767 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 04:29:00,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-05-20 04:29:00,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8129d3e/2087c544779e46d59bf690a2b0d37bcd/FLAG9ddd6e378 [2023-05-20 04:29:00,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af8129d3e/2087c544779e46d59bf690a2b0d37bcd [2023-05-20 04:29:00,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 04:29:00,803 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 04:29:00,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 04:29:00,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 04:29:00,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 04:29:00,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 04:29:00" (1/1) ... [2023-05-20 04:29:00,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc24c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:00, skipping insertion in model container [2023-05-20 04:29:00,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 04:29:00" (1/1) ... [2023-05-20 04:29:00,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 04:29:00,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 04:29:01,169 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_75-tricky_address2_racefree.i[41323,41336] [2023-05-20 04:29:01,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 04:29:01,216 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 04:29:01,247 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_75-tricky_address2_racefree.i[41323,41336] [2023-05-20 04:29:01,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 04:29:01,311 INFO L208 MainTranslator]: Completed translation [2023-05-20 04:29:01,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01 WrapperNode [2023-05-20 04:29:01,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 04:29:01,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 04:29:01,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 04:29:01,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 04:29:01,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,358 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 186 [2023-05-20 04:29:01,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 04:29:01,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 04:29:01,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 04:29:01,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 04:29:01,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,378 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 04:29:01,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 04:29:01,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 04:29:01,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 04:29:01,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (1/1) ... [2023-05-20 04:29:01,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 04:29:01,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:01,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-20 04:29:01,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-20 04:29:01,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-05-20 04:29:01,445 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 04:29:01,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 04:29:01,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 04:29:01,446 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 04:29:01,638 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 04:29:01,639 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 04:29:01,927 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 04:29:01,934 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 04:29:01,935 INFO L300 CfgBuilder]: Removed 23 assume(true) statements. [2023-05-20 04:29:01,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 04:29:01 BoogieIcfgContainer [2023-05-20 04:29:01,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 04:29:01,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 04:29:01,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 04:29:01,944 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 04:29:01,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 04:29:00" (1/3) ... [2023-05-20 04:29:01,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6922e144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 04:29:01, skipping insertion in model container [2023-05-20 04:29:01,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 04:29:01" (2/3) ... [2023-05-20 04:29:01,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6922e144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 04:29:01, skipping insertion in model container [2023-05-20 04:29:01,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 04:29:01" (3/3) ... [2023-05-20 04:29:01,947 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2023-05-20 04:29:01,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 04:29:01,962 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 04:29:01,962 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-05-20 04:29:01,963 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 04:29:02,029 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-05-20 04:29:02,064 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:29:02,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 04:29:02,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:02,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 04:29:02,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 04:29:02,090 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 04:29:02,103 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-05-20 04:29:02,107 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;@5dad27c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:29:02,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 04:29:02,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1668823948, now seen corresponding path program 1 times [2023-05-20 04:29:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:02,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078476439] [2023-05-20 04:29:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-05-20 04:29:02,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:02,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078476439] [2023-05-20 04:29:02,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078476439] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:29:02,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:29:02,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:29:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684707596] [2023-05-20 04:29:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:29:02,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:29:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:02,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:29:02,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:29:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:02,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:02,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:03,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:03,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 04:29:03,239 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:03,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -555839877, now seen corresponding path program 1 times [2023-05-20 04:29:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:03,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990272568] [2023-05-20 04:29:03,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 04:29:03,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:03,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990272568] [2023-05-20 04:29:03,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990272568] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:03,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398103023] [2023-05-20 04:29:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:03,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:03,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:03,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:03,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 04:29:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:03,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 04:29:03,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 04:29:03,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 04:29:03,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398103023] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:03,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:03,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 04:29:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050414405] [2023-05-20 04:29:03,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:03,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:29:03,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:03,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:29:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 04:29:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:03,558 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:03,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:03,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:03,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:03,706 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-20 04:29:03,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-05-20 04:29:03,897 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:03,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1613177467, now seen corresponding path program 2 times [2023-05-20 04:29:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:03,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449658489] [2023-05-20 04:29:03,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 04:29:04,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:04,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449658489] [2023-05-20 04:29:04,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449658489] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:04,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896227622] [2023-05-20 04:29:04,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:29:04,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:04,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:04,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 04:29:04,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-05-20 04:29:04,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:29:04,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 17 conjunts are in the unsatisfiable core [2023-05-20 04:29:04,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:04,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:29:04,459 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:29:04,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:29:04,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:04,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-20 04:29:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-20 04:29:04,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-05-20 04:29:04,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896227622] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:29:04,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-05-20 04:29:04,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2023-05-20 04:29:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150496955] [2023-05-20 04:29:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:29:04,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:29:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:04,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:29:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-05-20 04:29:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:04,608 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:04,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:04,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:04,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:04,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:04,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:05,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:05,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:05,102 INFO L85 PathProgramCache]: Analyzing trace with hash -150954679, now seen corresponding path program 1 times [2023-05-20 04:29:05,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:05,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823467550] [2023-05-20 04:29:05,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:05,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-20 04:29:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:05,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823467550] [2023-05-20 04:29:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823467550] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982968469] [2023-05-20 04:29:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:05,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:05,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:05,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 04:29:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:05,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 04:29:05,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 04:29:05,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-20 04:29:05,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982968469] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:05,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:05,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2023-05-20 04:29:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597106861] [2023-05-20 04:29:05,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:05,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-20 04:29:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:05,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-20 04:29:05,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-05-20 04:29:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:05,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:05,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.473684210526315) internal successors, (161), 19 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:05,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:05,425 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:05,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:05,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-20 04:29:05,642 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 04:29:05,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:05,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:05,857 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2023-05-20 04:29:05,859 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-05-20 04:29:05,862 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:29:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 04:29:05,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:05,863 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 04:29:05,866 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 04:29:05,867 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 04:29:05,867 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;@5dad27c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:29:05,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-20 04:29:05,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-05-20 04:29:05,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:29:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1898453955, now seen corresponding path program 1 times [2023-05-20 04:29:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:05,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190187152] [2023-05-20 04:29:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 04:29:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:05,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190187152] [2023-05-20 04:29:05,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190187152] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:29:05,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:29:05,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:29:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057196360] [2023-05-20 04:29:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:29:05,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:29:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:29:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:29:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:05,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:05,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:05,992 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:06,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-20 04:29:06,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:29:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2039067449, now seen corresponding path program 1 times [2023-05-20 04:29:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:06,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283692165] [2023-05-20 04:29:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 04:29:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:06,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283692165] [2023-05-20 04:29:06,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283692165] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:06,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965837782] [2023-05-20 04:29:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:06,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:06,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:06,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:06,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-20 04:29:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:06,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 04:29:06,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 04:29:06,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 04:29:06,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965837782] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:06,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:06,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 04:29:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853332448] [2023-05-20 04:29:06,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:06,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:29:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:06,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:29:06,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 04:29:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:06,203 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:06,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 10 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:06,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:06,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:06,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:06,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:06,462 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:29:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1909540665, now seen corresponding path program 2 times [2023-05-20 04:29:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:06,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404412836] [2023-05-20 04:29:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:06,547 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 04:29:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:06,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404412836] [2023-05-20 04:29:06,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404412836] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:06,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875033747] [2023-05-20 04:29:06,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:29:06,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:06,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:06,550 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:06,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-20 04:29:06,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:29:06,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:29:06,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 04:29:06,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:06,672 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 04:29:06,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:06,729 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-05-20 04:29:06,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875033747] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:06,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:06,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 04:29:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325056775] [2023-05-20 04:29:06,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:06,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 04:29:06,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 04:29:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 04:29:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:06,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:06,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:06,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:06,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:06,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:06,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:07,069 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-20 04:29:07,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:29:07,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:07,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1318752455, now seen corresponding path program 3 times [2023-05-20 04:29:07,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:07,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289319439] [2023-05-20 04:29:07,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:07,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:07,377 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-20 04:29:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289319439] [2023-05-20 04:29:07,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289319439] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:07,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497968205] [2023-05-20 04:29:07,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 04:29:07,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:07,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:07,380 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:07,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-05-20 04:29:07,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-05-20 04:29:07,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:29:07,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 04:29:07,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:07,601 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-20 04:29:07,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:07,814 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-20 04:29:07,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497968205] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:07,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:07,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-20 04:29:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012795669] [2023-05-20 04:29:07,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:07,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-20 04:29:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-20 04:29:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-20 04:29:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:07,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:07,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.6521739130434785) internal successors, (107), 23 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:07,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:07,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:07,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:07,818 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:08,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:08,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:08,297 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-20 04:29:08,297 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:29:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:08,298 INFO L85 PathProgramCache]: Analyzing trace with hash -639535271, now seen corresponding path program 4 times [2023-05-20 04:29:08,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:08,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188707032] [2023-05-20 04:29:08,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:08,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 04:29:08,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 04:29:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 04:29:08,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 04:29:08,358 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 04:29:08,358 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-20 04:29:08,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-20 04:29:08,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-20 04:29:08,361 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1] [2023-05-20 04:29:08,362 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-05-20 04:29:08,363 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-20 04:29:08,363 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-05-20 04:29:08,400 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 04:29:08,402 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:29:08,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 04:29:08,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:08,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 04:29:08,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-05-20 04:29:08,409 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 04:29:08,410 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-05-20 04:29:08,410 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;@5dad27c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:29:08,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 04:29:08,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2105364623, now seen corresponding path program 1 times [2023-05-20 04:29:08,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:08,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594344390] [2023-05-20 04:29:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:08,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-20 04:29:08,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:08,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594344390] [2023-05-20 04:29:08,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594344390] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:29:08,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:29:08,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:29:08,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661126039] [2023-05-20 04:29:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:29:08,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:29:08,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:08,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:29:08,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:29:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:08,581 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:08,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:08,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:08,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:08,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-20 04:29:08,666 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:08,667 INFO L85 PathProgramCache]: Analyzing trace with hash -72600017, now seen corresponding path program 1 times [2023-05-20 04:29:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908891339] [2023-05-20 04:29:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:29:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:08,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908891339] [2023-05-20 04:29:08,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908891339] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:08,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073570032] [2023-05-20 04:29:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:08,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:08,716 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-20 04:29:08,719 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-20 04:29:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:08,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 04:29:08,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:08,821 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:29:08,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:29:08,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073570032] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:08,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:08,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 04:29:08,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417837220] [2023-05-20 04:29:08,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:08,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:29:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:29:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 04:29:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:08,845 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:08,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 10 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:08,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:08,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:08,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:08,932 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-20 04:29:09,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-05-20 04:29:09,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1541117455, now seen corresponding path program 2 times [2023-05-20 04:29:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:09,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314306547] [2023-05-20 04:29:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:29:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314306547] [2023-05-20 04:29:09,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314306547] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472647859] [2023-05-20 04:29:09,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:29:09,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:09,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:09,241 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:09,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-05-20 04:29:09,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:29:09,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:29:09,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 04:29:09,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:29:09,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:29:09,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472647859] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:09,415 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:09,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 04:29:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278569443] [2023-05-20 04:29:09,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:09,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 04:29:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:09,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 04:29:09,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 04:29:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:09,416 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:09,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.555555555555555) internal successors, (118), 18 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:09,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:09,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:09,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:09,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:09,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:09,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-05-20 04:29:09,765 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:09,765 INFO L85 PathProgramCache]: Analyzing trace with hash -279097905, now seen corresponding path program 3 times [2023-05-20 04:29:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:09,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146754977] [2023-05-20 04:29:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:10,021 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:29:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:10,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146754977] [2023-05-20 04:29:10,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146754977] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:10,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816179700] [2023-05-20 04:29:10,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 04:29:10,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:10,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:10,023 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-05-20 04:29:10,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-20 04:29:10,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:29:10,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 19 conjunts are in the unsatisfiable core [2023-05-20 04:29:10,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:10,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:29:10,350 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:29:10,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:29:10,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:10,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:10,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:10,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-20 04:29:10,594 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2023-05-20 04:29:10,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:10,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_426) |c_~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-20 04:29:11,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 13 treesize of output 7 [2023-05-20 04:29:11,240 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:29:11,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-20 04:29:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 2 not checked. [2023-05-20 04:29:11,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816179700] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:11,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:11,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 32 [2023-05-20 04:29:11,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919718842] [2023-05-20 04:29:11,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:11,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-05-20 04:29:11,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:11,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-05-20 04:29:11,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=805, Unknown=1, NotChecked=58, Total=992 [2023-05-20 04:29:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:11,246 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:11,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.46875) internal successors, (271), 32 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:11,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:11,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:11,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:11,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:14,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 04:29:14,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:14,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-05-20 04:29:14,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:14,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:14,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1827374774, now seen corresponding path program 1 times [2023-05-20 04:29:14,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:14,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239844442] [2023-05-20 04:29:14,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2023-05-20 04:29:14,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:14,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239844442] [2023-05-20 04:29:14,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239844442] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:29:14,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:29:14,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:29:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965819953] [2023-05-20 04:29:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:29:14,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:29:14,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:14,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:29:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:29:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:14,670 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:14,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:14,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:14,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:14,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:14,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 04:29:14,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:14,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:14,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:14,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:14,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:14,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-20 04:29:14,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:14,832 INFO L85 PathProgramCache]: Analyzing trace with hash -46140812, now seen corresponding path program 1 times [2023-05-20 04:29:14,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:14,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980964809] [2023-05-20 04:29:14,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:14,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:29:15,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980964809] [2023-05-20 04:29:15,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980964809] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:15,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645532844] [2023-05-20 04:29:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:15,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:15,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:15,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:15,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-05-20 04:29:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:15,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 18 conjunts are in the unsatisfiable core [2023-05-20 04:29:15,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:29:15,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:29:15,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645532844] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:15,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:15,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2023-05-20 04:29:15,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737419611] [2023-05-20 04:29:15,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:15,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-20 04:29:15,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:15,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-20 04:29:15,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-20 04:29:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:15,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:15,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:15,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:15,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:15,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:15,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:15,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:15,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:15,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:15,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-05-20 04:29:15,945 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2109568428, now seen corresponding path program 2 times [2023-05-20 04:29:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674336822] [2023-05-20 04:29:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:29:16,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:16,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674336822] [2023-05-20 04:29:16,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674336822] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:16,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579885857] [2023-05-20 04:29:16,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:29:16,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:16,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:16,059 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:16,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-05-20 04:29:16,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:29:16,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:29:16,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 04:29:16,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:29:16,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:29:16,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579885857] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:16,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:16,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-05-20 04:29:16,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793352494] [2023-05-20 04:29:16,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:16,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-20 04:29:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:16,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-20 04:29:16,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-05-20 04:29:16,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:16,274 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:16,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.428571428571429) internal successors, (174), 14 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:16,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:16,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:16,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:16,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:16,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:16,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:16,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:16,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:16,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:16,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 389665335, now seen corresponding path program 1 times [2023-05-20 04:29:16,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:16,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968419461] [2023-05-20 04:29:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:29:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:17,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968419461] [2023-05-20 04:29:17,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968419461] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:17,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359764147] [2023-05-20 04:29:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:17,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:17,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:17,665 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:17,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-05-20 04:29:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:17,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-20 04:29:17,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:17,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:29:18,047 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:29:18,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:29:18,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:18,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:18,197 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 16 treesize of output 12 [2023-05-20 04:29:18,318 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:29:18,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:29:18,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:18,485 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 22 treesize of output 17 [2023-05-20 04:29:18,550 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 25 treesize of output 21 [2023-05-20 04:29:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:29:18,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:18,659 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_697 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_697) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (not (= |c_t_funThread1of2ForFork0_~i~0#1| |c_t_funThread2of2ForFork0_~i~0#1|))) is different from false [2023-05-20 04:29:18,860 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 25 treesize of output 16 [2023-05-20 04:29:18,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:29:18,866 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 21 treesize of output 12 [2023-05-20 04:29:18,874 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (forall ((v_ArrVal_697 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_697) |c_~#a~0.base|) .cse0) 0)) (= .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-05-20 04:29:20,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_697 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_697) |c_~#a~0.base|) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-20 04:29:21,374 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 13 treesize of output 7 [2023-05-20 04:29:21,403 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:29:21,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-20 04:29:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 19 not checked. [2023-05-20 04:29:21,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359764147] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:21,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:21,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2023-05-20 04:29:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469136882] [2023-05-20 04:29:21,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:21,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-05-20 04:29:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:21,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-05-20 04:29:21,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=737, Unknown=3, NotChecked=174, Total=1056 [2023-05-20 04:29:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:21,411 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:21,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.212121212121213) internal successors, (271), 33 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:21,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:33,823 WARN L233 SmtUtils]: Spent 12.35s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:29:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:37,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:37,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:29:37,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-05-20 04:29:37,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-20 04:29:37,455 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:29:37,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:29:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1914753937, now seen corresponding path program 1 times [2023-05-20 04:29:37,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:29:37,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586202422] [2023-05-20 04:29:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:37,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:29:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-05-20 04:29:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:29:38,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586202422] [2023-05-20 04:29:38,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586202422] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:29:38,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009542445] [2023-05-20 04:29:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:29:38,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:29:38,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:29:38,353 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:29:38,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-05-20 04:29:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:29:38,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-20 04:29:38,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:29:38,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:29:38,769 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:29:38,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:29:38,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:38,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:38,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:29:39,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-20 04:29:39,166 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 48 treesize of output 41 [2023-05-20 04:29:39,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-20 04:29:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2023-05-20 04:29:39,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:29:41,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~post39#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:29:43,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:29:45,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:29:47,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) |c_t_funThread2of2ForFork0_#t~post36#1|) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:29:49,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) |c_t_funThread2of2ForFork0_#t~mem35#1|) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:29:49,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_801) |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-20 04:29:49,935 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:29:49,936 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 40 treesize of output 41 [2023-05-20 04:29:49,961 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:29:49,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-20 04:29:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 2 not checked. [2023-05-20 04:29:49,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009542445] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:29:49,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:29:49,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 35 [2023-05-20 04:29:49,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795131580] [2023-05-20 04:29:49,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:29:49,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-05-20 04:29:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:29:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-05-20 04:29:49,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=697, Unknown=6, NotChecked=354, Total=1190 [2023-05-20 04:29:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:29:49,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:29:49,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.028571428571428) internal successors, (281), 35 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:29:49,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:30:02,134 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:30:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:30:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:30:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:30:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:30:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:30:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:30:19,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:30:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:30:19,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-20 04:30:19,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-05-20 04:30:19,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-05-20 04:30:19,845 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:30:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:30:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1162855945, now seen corresponding path program 2 times [2023-05-20 04:30:19,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:30:19,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474183178] [2023-05-20 04:30:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:30:19,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:30:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:30:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:30:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:30:20,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474183178] [2023-05-20 04:30:20,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474183178] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:30:20,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154110272] [2023-05-20 04:30:20,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:30:20,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:30:20,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:30:20,738 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:30:20,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-05-20 04:30:20,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:30:20,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:30:20,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 38 conjunts are in the unsatisfiable core [2023-05-20 04:30:20,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:30:20,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:30:21,308 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:30:21,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:30:21,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:30:21,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:30:21,759 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 16 treesize of output 12 [2023-05-20 04:30:21,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:30:21,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:30:22,000 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 19 treesize of output 21 [2023-05-20 04:30:22,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-05-20 04:30:22,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:30:22,132 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 19 treesize of output 21 [2023-05-20 04:30:22,186 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:30:22,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:30:22,259 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 25 treesize of output 21 [2023-05-20 04:30:22,306 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:30:22,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:30:22,463 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_895 Int) (v_ArrVal_893 (Array Int Int))) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_895) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_897 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_897) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|)) 0)))) is different from false [2023-05-20 04:30:22,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:30:22,497 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-05-20 04:30:22,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:30:22,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-05-20 04:30:22,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-05-20 04:30:22,955 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_895 Int) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_893 (Array Int Int))) (let ((.cse1 (* 28 |t_funThread2of2ForFork0_~i~0#1|)) (.cse0 (* |t_funThread1of2ForFork0_~i~0#1| 28))) (or (= .cse0 .cse1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ .cse1 |~#a~0.offset|) v_ArrVal_895) (+ .cse0 |~#a~0.offset|)) 0))))) is different from false [2023-05-20 04:30:34,655 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:30:34,663 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:30:34,665 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 13 treesize of output 7 [2023-05-20 04:30:36,716 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-20 04:30:36,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-20 04:30:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 19 not checked. [2023-05-20 04:30:36,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154110272] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:30:36,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:30:36,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 40 [2023-05-20 04:30:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481744511] [2023-05-20 04:30:36,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:30:36,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-05-20 04:30:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:30:36,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-05-20 04:30:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1148, Unknown=23, NotChecked=146, Total=1560 [2023-05-20 04:30:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:30:36,728 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:30:36,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.8) internal successors, (312), 40 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:30:36,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:30:36,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:30:36,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:30:36,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:30:36,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:30:36,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:30:36,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:30:36,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:30:36,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-20 04:30:36,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:30:50,854 WARN L233 SmtUtils]: Spent 14.04s on a formula simplification. DAG size of input: 39 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:30:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:30:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-20 04:30:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-20 04:30:53,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-05-20 04:30:53,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:30:53,476 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:30:53,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:30:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash -642320529, now seen corresponding path program 2 times [2023-05-20 04:30:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:30:53,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818480908] [2023-05-20 04:30:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:30:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:30:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:30:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-05-20 04:30:54,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:30:54,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818480908] [2023-05-20 04:30:54,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818480908] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:30:54,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146518661] [2023-05-20 04:30:54,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:30:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:30:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:30:54,193 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:30:54,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-05-20 04:30:54,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:30:54,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:30:54,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 35 conjunts are in the unsatisfiable core [2023-05-20 04:30:54,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:30:54,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:30:54,613 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:30:54,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:30:54,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:30:54,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:30:54,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-20 04:30:54,970 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 40 treesize of output 40 [2023-05-20 04:30:55,032 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 45 treesize of output 40 [2023-05-20 04:30:55,098 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 32 treesize of output 28 [2023-05-20 04:30:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2023-05-20 04:30:55,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:30:59,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~post39#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:31:01,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:31:03,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:31:05,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse0 (+ (- 1) (select (select |c_#memory_int| |c_~#a~0.base|) .cse0)))) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:31:07,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 (+ |c_t_funThread2of2ForFork0_#t~post36#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse0 |c_t_funThread2of2ForFork0_#t~post36#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-05-20 04:31:09,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1001 (Array Int Int)) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= 0 (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse0 (+ |c_t_funThread2of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse0 |c_t_funThread2of2ForFork0_#t~mem35#1|)) (+ |c_~#a~0.offset| (* |t_funThread1of2ForFork0_~i~0#1| 28))))) is different from false [2023-05-20 04:31:11,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (v_ArrVal_1001 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse2 (select .cse0 .cse1))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse1 .cse2))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-20 04:31:13,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1001 (Array Int Int)) (|t_funThread2of2ForFork0_~i~0#1| Int) (|t_funThread1of2ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_998))) (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1001) |c_~#a~0.base|) .cse2 .cse3)))) (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-20 04:31:13,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:31:13,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2023-05-20 04:31:13,884 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 145 treesize of output 133 [2023-05-20 04:31:13,935 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:31:13,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-20 04:31:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 16 not checked. [2023-05-20 04:31:13,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146518661] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:13,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:13,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 38 [2023-05-20 04:31:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140211554] [2023-05-20 04:31:13,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:13,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-05-20 04:31:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:13,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-05-20 04:31:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=764, Unknown=8, NotChecked=504, Total=1406 [2023-05-20 04:31:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:13,942 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:13,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 8.31578947368421) internal successors, (316), 38 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-05-20 04:31:13,942 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-05-20 04:31:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-20 04:31:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-20 04:31:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-20 04:31:24,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 04:31:24,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:25,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:25,143 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1] [2023-05-20 04:31:25,143 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2023-05-20 04:31:25,148 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:31:25,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 04:31:25,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:25,149 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 04:31:25,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (20)] Waiting until timeout for monitored process [2023-05-20 04:31:25,155 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 04:31:25,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 04:31:25,156 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;@5dad27c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:31:25,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-20 04:31:25,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:25,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2114264243, now seen corresponding path program 1 times [2023-05-20 04:31:25,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:25,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723227886] [2023-05-20 04:31:25,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:25,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2023-05-20 04:31:25,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723227886] [2023-05-20 04:31:25,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723227886] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:25,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:25,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:31:25,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61095996] [2023-05-20 04:31:25,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:25,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:31:25,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:31:25,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:31:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:25,317 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:25,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:25,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:25,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:25,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-05-20 04:31:25,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:25,412 INFO L85 PathProgramCache]: Analyzing trace with hash 362414810, now seen corresponding path program 1 times [2023-05-20 04:31:25,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:25,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314638828] [2023-05-20 04:31:25,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:25,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:25,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:25,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314638828] [2023-05-20 04:31:25,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314638828] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:25,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823850446] [2023-05-20 04:31:25,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:25,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:25,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:25,456 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:25,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-05-20 04:31:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:25,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 04:31:25,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:25,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:25,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823850446] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:25,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:25,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 04:31:25,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825270121] [2023-05-20 04:31:25,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:25,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:31:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:31:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 04:31:25,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:25,676 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:25,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:25,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:25,676 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:25,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:25,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-05-20 04:31:25,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:25,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1541037818, now seen corresponding path program 2 times [2023-05-20 04:31:25,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:25,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048135129] [2023-05-20 04:31:25,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-05-20 04:31:26,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:26,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048135129] [2023-05-20 04:31:26,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048135129] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:26,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:26,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:31:26,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70731310] [2023-05-20 04:31:26,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:26,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:31:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:26,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:31:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:31:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:26,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:26,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:26,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:26,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:26,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:26,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-05-20 04:31:26,043 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:26,044 INFO L85 PathProgramCache]: Analyzing trace with hash 107909962, now seen corresponding path program 3 times [2023-05-20 04:31:26,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:26,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235829979] [2023-05-20 04:31:26,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:26,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:26,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235829979] [2023-05-20 04:31:26,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235829979] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:26,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811157975] [2023-05-20 04:31:26,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 04:31:26,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:26,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:26,146 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:26,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-05-20 04:31:26,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-20 04:31:26,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:31:26,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 04:31:26,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-20 04:31:26,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-20 04:31:26,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811157975] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:26,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:26,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2023-05-20 04:31:26,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186128842] [2023-05-20 04:31:26,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:26,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-20 04:31:26,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:26,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-20 04:31:26,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-05-20 04:31:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:26,447 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:26,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.578947368421053) internal successors, (220), 19 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:26,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:26,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:26,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:26,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:26,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-20 04:31:26,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:26,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-05-20 04:31:26,790 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:26,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:26,790 INFO L85 PathProgramCache]: Analyzing trace with hash 705833280, now seen corresponding path program 1 times [2023-05-20 04:31:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:26,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845041382] [2023-05-20 04:31:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:26,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:31:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845041382] [2023-05-20 04:31:26,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845041382] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:26,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928266357] [2023-05-20 04:31:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:26,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:26,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:26,903 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-05-20 04:31:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:27,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 04:31:27,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:31:27,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:31:27,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928266357] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:27,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:27,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-05-20 04:31:27,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811847125] [2023-05-20 04:31:27,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:27,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-05-20 04:31:27,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:27,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-05-20 04:31:27,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-05-20 04:31:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:27,156 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:27,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 22 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:27,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:27,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:27,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:27,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-20 04:31:27,156 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:27,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-20 04:31:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-20 04:31:27,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:27,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:27,551 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1214592147, now seen corresponding path program 2 times [2023-05-20 04:31:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:27,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873025447] [2023-05-20 04:31:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:31:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:27,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873025447] [2023-05-20 04:31:27,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873025447] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:27,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705931544] [2023-05-20 04:31:27,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:31:27,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:27,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:27,811 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:27,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-05-20 04:31:27,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:31:27,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:31:27,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjunts are in the unsatisfiable core [2023-05-20 04:31:27,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:31:28,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 04:31:28,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705931544] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:28,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:28,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2023-05-20 04:31:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054998871] [2023-05-20 04:31:28,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:28,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-20 04:31:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:28,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-20 04:31:28,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-20 04:31:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:28,176 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:28,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 23 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:28,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:28,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:28,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:28,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-20 04:31:28,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2023-05-20 04:31:28,177 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-20 04:31:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-05-20 04:31:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:28,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-05-20 04:31:28,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:28,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash 345089440, now seen corresponding path program 3 times [2023-05-20 04:31:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:28,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491071724] [2023-05-20 04:31:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:28,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 04:31:28,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 04:31:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 04:31:28,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 04:31:28,654 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 04:31:28,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-20 04:31:28,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-20 04:31:28,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-05-20 04:31:28,655 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 1] [2023-05-20 04:31:28,655 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2023-05-20 04:31:28,655 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-20 04:31:28,655 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-05-20 04:31:28,669 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-20 04:31:28,671 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:31:28,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 04:31:28,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:28,672 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 04:31:28,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2023-05-20 04:31:28,677 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 04:31:28,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 04:31:28,678 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;@5dad27c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:31:28,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-05-20 04:31:28,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:28,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:28,805 INFO L85 PathProgramCache]: Analyzing trace with hash 883447984, now seen corresponding path program 1 times [2023-05-20 04:31:28,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:28,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807480771] [2023-05-20 04:31:28,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:28,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-20 04:31:28,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:28,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807480771] [2023-05-20 04:31:28,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807480771] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:28,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:28,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 04:31:28,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313445908] [2023-05-20 04:31:28,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:28,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 04:31:28,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:28,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 04:31:28,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 04:31:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:28,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:28,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.5) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:28,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:30,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:30,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-05-20 04:31:30,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:30,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1602395689, now seen corresponding path program 1 times [2023-05-20 04:31:30,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:30,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382379684] [2023-05-20 04:31:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:30,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382379684] [2023-05-20 04:31:30,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382379684] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:30,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:30,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:31:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393442455] [2023-05-20 04:31:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:30,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:31:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:30,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:31:30,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:31:30,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:30,184 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:30,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:30,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:30,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:30,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-05-20 04:31:30,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:30,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash 4043947, now seen corresponding path program 1 times [2023-05-20 04:31:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:30,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100680515] [2023-05-20 04:31:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:30,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:30,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100680515] [2023-05-20 04:31:30,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100680515] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:30,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207188824] [2023-05-20 04:31:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:30,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:30,832 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:30,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-05-20 04:31:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:30,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 04:31:30,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:30,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:31,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207188824] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:31,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:31,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 04:31:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330863732] [2023-05-20 04:31:31,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:31,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:31:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:31:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 04:31:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:31,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:31,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:31,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:31,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:31,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:31,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:31,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2068888427, now seen corresponding path program 2 times [2023-05-20 04:31:31,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:31,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885277508] [2023-05-20 04:31:31,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:31,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-05-20 04:31:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:31,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885277508] [2023-05-20 04:31:31,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885277508] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:31,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:31,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:31:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501516946] [2023-05-20 04:31:31,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:31,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:31:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:31,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:31:31,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:31:31,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,808 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:31,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:31,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:31,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:31,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:31,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-05-20 04:31:31,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -58909368, now seen corresponding path program 1 times [2023-05-20 04:31:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:31,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209243682] [2023-05-20 04:31:31,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:31,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:31,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:31,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209243682] [2023-05-20 04:31:31,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209243682] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:31,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36761308] [2023-05-20 04:31:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:31,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:31,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:31,931 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:31,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-05-20 04:31:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:32,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 04:31:32,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:32,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:32,200 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:32,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36761308] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:32,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:32,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 04:31:32,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033768964] [2023-05-20 04:31:32,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:32,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 04:31:32,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:32,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 04:31:32,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 04:31:32,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:32,202 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:32,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.666666666666666) internal successors, (156), 18 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:32,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:32,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:32,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:32,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:32,202 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:32,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:32,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-05-20 04:31:32,537 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -786859320, now seen corresponding path program 2 times [2023-05-20 04:31:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:32,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033291871] [2023-05-20 04:31:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:32,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:32,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033291871] [2023-05-20 04:31:32,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033291871] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:32,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982710407] [2023-05-20 04:31:32,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:31:32,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:32,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:32,722 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:32,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-05-20 04:31:32,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:31:32,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:31:32,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 04:31:32,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:32,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:33,068 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 04:31:33,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982710407] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:33,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:33,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-20 04:31:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000232818] [2023-05-20 04:31:33,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:33,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-20 04:31:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:33,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-20 04:31:33,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-20 04:31:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,070 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:33,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.434782608695652) internal successors, (171), 23 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:33,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:33,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:33,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:33,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:33,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:33,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:33,484 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 286645958, now seen corresponding path program 3 times [2023-05-20 04:31:33,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:33,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206407204] [2023-05-20 04:31:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:33,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:31:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:33,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206407204] [2023-05-20 04:31:33,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206407204] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:33,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338980475] [2023-05-20 04:31:33,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 04:31:33,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:33,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:33,561 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:33,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-05-20 04:31:33,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-20 04:31:33,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:31:33,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 04:31:33,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:31:33,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-05-20 04:31:33,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338980475] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:33,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:33,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-05-20 04:31:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637292979] [2023-05-20 04:31:33,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-05-20 04:31:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:33,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-05-20 04:31:33,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-05-20 04:31:33,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,866 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:33,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.285714285714286) internal successors, (200), 14 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:33,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:33,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:33,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:33,867 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:33,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-20 04:31:33,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:34,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:34,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 04:31:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:34,193 INFO L85 PathProgramCache]: Analyzing trace with hash 647877238, now seen corresponding path program 1 times [2023-05-20 04:31:34,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:34,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185612265] [2023-05-20 04:31:34,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 04:31:34,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 04:31:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 04:31:34,274 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 04:31:34,275 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 04:31:34,275 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-05-20 04:31:34,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-05-20 04:31:34,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-05-20 04:31:34,276 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2023-05-20 04:31:34,276 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2023-05-20 04:31:34,276 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-05-20 04:31:34,276 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-05-20 04:31:34,298 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-05-20 04:31:34,301 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:31:34,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 04:31:34,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:34,314 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 04:31:34,318 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 04:31:34,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2023-05-20 04:31:34,320 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;@5dad27c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 04:31:34,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 04:31:34,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (30)] Waiting until timeout for monitored process [2023-05-20 04:31:34,585 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:31:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash -79768482, now seen corresponding path program 1 times [2023-05-20 04:31:34,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:34,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169247335] [2023-05-20 04:31:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:34,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2023-05-20 04:31:34,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:34,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169247335] [2023-05-20 04:31:34,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169247335] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:34,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:34,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:31:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180750341] [2023-05-20 04:31:34,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:34,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:31:34,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:34,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:31:34,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:31:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:34,638 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:34,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:34,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:34,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:34,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-05-20 04:31:34,774 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:31:34,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1998931043, now seen corresponding path program 1 times [2023-05-20 04:31:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:34,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639730691] [2023-05-20 04:31:34,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:34,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639730691] [2023-05-20 04:31:34,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639730691] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:34,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496871415] [2023-05-20 04:31:34,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:34,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:34,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:34,830 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:34,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-05-20 04:31:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:35,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-20 04:31:35,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:35,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:35,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496871415] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:35,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:35,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-20 04:31:35,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791852444] [2023-05-20 04:31:35,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:35,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-20 04:31:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:35,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-20 04:31:35,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-20 04:31:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:35,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:35,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:35,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:35,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:35,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:35,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-05-20 04:31:35,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:31:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:35,311 INFO L85 PathProgramCache]: Analyzing trace with hash 739053507, now seen corresponding path program 2 times [2023-05-20 04:31:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:35,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050921167] [2023-05-20 04:31:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:35,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:35,386 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-05-20 04:31:35,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:35,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050921167] [2023-05-20 04:31:35,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050921167] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:35,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:35,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 04:31:35,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204163234] [2023-05-20 04:31:35,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:35,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 04:31:35,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:35,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 04:31:35,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 04:31:35,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:35,387 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:35,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:35,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:35,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:35,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:35,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:35,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-05-20 04:31:35,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:31:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:35,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1011765648, now seen corresponding path program 1 times [2023-05-20 04:31:35,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:35,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830048303] [2023-05-20 04:31:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:35,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:35,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:35,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830048303] [2023-05-20 04:31:35,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830048303] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:35,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434113720] [2023-05-20 04:31:35,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:35,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:35,597 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:35,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-05-20 04:31:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:35,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2023-05-20 04:31:35,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:35,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:35,872 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:35,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434113720] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:35,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:35,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-05-20 04:31:35,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366124104] [2023-05-20 04:31:35,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:35,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-20 04:31:35,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:35,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-20 04:31:35,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-05-20 04:31:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:35,873 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:35,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.055555555555555) internal successors, (181), 18 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:35,873 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:35,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:35,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:35,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:36,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:36,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:36,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-05-20 04:31:36,229 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:31:36,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:36,229 INFO L85 PathProgramCache]: Analyzing trace with hash -768971472, now seen corresponding path program 2 times [2023-05-20 04:31:36,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:36,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087057247] [2023-05-20 04:31:36,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:36,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:36,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087057247] [2023-05-20 04:31:36,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087057247] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:36,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999695995] [2023-05-20 04:31:36,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:31:36,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:36,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:36,498 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:36,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-05-20 04:31:36,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:31:36,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:31:36,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 04:31:36,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:36,771 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:36,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2023-05-20 04:31:36,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999695995] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:31:36,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:31:36,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2023-05-20 04:31:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439457839] [2023-05-20 04:31:36,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:31:36,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-05-20 04:31:36,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-05-20 04:31:36,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-05-20 04:31:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:36,916 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:36,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.521739130434783) internal successors, (196), 23 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:36,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:36,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:36,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:36,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:36,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:37,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-05-20 04:31:37,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-05-20 04:31:37,346 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:31:37,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:37,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1373985681, now seen corresponding path program 3 times [2023-05-20 04:31:37,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:37,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732340217] [2023-05-20 04:31:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2023-05-20 04:31:37,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:37,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732340217] [2023-05-20 04:31:37,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732340217] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 04:31:37,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 04:31:37,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-20 04:31:37,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569175542] [2023-05-20 04:31:37,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 04:31:37,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 04:31:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:31:37,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 04:31:37,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-05-20 04:31:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:37,601 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:31:37,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:31:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:37,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:31:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:31:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:31:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:31:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:31:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:31:37,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-05-20 04:31:37,682 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:31:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:31:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -117270506, now seen corresponding path program 1 times [2023-05-20 04:31:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:31:37,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540743989] [2023-05-20 04:31:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:31:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-20 04:31:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:31:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540743989] [2023-05-20 04:31:38,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540743989] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:31:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555424685] [2023-05-20 04:31:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:31:38,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:31:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:31:38,636 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:31:38,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-05-20 04:31:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:31:38,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 50 conjunts are in the unsatisfiable core [2023-05-20 04:31:38,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:31:38,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:31:39,204 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:31:39,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:31:39,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:31:39,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:31:39,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:31:39,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:31:39,728 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 16 treesize of output 12 [2023-05-20 04:31:39,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:31:40,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:31:40,212 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 19 treesize of output 21 [2023-05-20 04:31:40,266 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:31:40,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:31:40,353 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 22 treesize of output 17 [2023-05-20 04:31:40,446 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 25 treesize of output 21 [2023-05-20 04:31:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-20 04:31:40,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:31:40,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2248) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2249) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-05-20 04:31:40,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:31:40,947 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-05-20 04:31:40,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:31:40,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-05-20 04:31:40,958 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 25 treesize of output 18 [2023-05-20 04:31:40,988 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (let ((.cse0 (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) .cse1 v_ArrVal_2249) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)))) (and (or .cse0 (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) .cse0) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (v_ArrVal_2249 Int)) (let ((.cse2 (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) .cse1 v_ArrVal_2249) .cse2) 0) (= .cse2 |c_t_funThread3of4ForFork0_~p~0#1.offset|))))))) is different from false [2023-05-20 04:31:43,004 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_2249 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_2249) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_2249 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2249) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-05-20 04:31:49,400 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:31:55,493 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 32 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:31:57,532 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2247 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_2249 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2247) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_2249) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-05-20 04:32:09,583 WARN L233 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:32:09,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:32:09,591 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 13 treesize of output 7 [2023-05-20 04:32:11,645 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-20 04:32:11,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-20 04:32:11,656 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 66 not checked. [2023-05-20 04:32:11,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555424685] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:32:11,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:32:11,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 22] total 49 [2023-05-20 04:32:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562861090] [2023-05-20 04:32:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:32:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-05-20 04:32:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:32:11,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-05-20 04:32:11,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1681, Unknown=9, NotChecked=356, Total=2352 [2023-05-20 04:32:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:32:11,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:32:11,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 9.10204081632653) internal successors, (446), 49 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:32:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:32:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:32:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:32:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:32:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:32:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:32:11,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:32:33,881 WARN L233 SmtUtils]: Spent 22.10s on a formula simplification. DAG size of input: 39 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:32:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:32:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:32:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:32:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:32:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:32:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:32:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-05-20 04:32:34,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-05-20 04:32:34,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-05-20 04:32:34,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:32:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:32:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1050224952, now seen corresponding path program 1 times [2023-05-20 04:32:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:32:34,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076960799] [2023-05-20 04:32:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:32:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:32:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:32:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-20 04:32:35,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:32:35,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076960799] [2023-05-20 04:32:35,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076960799] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:32:35,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778046036] [2023-05-20 04:32:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:32:35,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:32:35,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:32:35,695 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:32:35,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-05-20 04:32:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:32:35,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 48 conjunts are in the unsatisfiable core [2023-05-20 04:32:35,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:32:35,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:32:36,146 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:32:36,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:32:36,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:32:36,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:32:36,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:32:36,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:32:36,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:32:36,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-05-20 04:32:36,865 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 48 treesize of output 41 [2023-05-20 04:32:36,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-05-20 04:32:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2023-05-20 04:32:36,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:32:41,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread3of4ForFork0_#t~post39#1|)) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-20 04:32:43,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) (+ |c_t_funThread3of4ForFork0_#t~mem38#1| (- 1))) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-20 04:32:45,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-20 04:32:47,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) |c_t_funThread3of4ForFork0_#t~post36#1|) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-20 04:32:49,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) |c_t_funThread3of4ForFork0_#t~mem35#1|) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-20 04:32:57,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2378 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2378) |c_~#a~0.base|)) (.cse1 (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-20 04:32:59,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:32:59,856 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 40 treesize of output 41 [2023-05-20 04:32:59,888 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:32:59,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-20 04:32:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 4 not checked. [2023-05-20 04:32:59,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778046036] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:32:59,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:32:59,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 20] total 45 [2023-05-20 04:32:59,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197654916] [2023-05-20 04:32:59,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:32:59,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-05-20 04:32:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:32:59,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-05-20 04:32:59,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1277, Unknown=9, NotChecked=474, Total=1980 [2023-05-20 04:32:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:32:59,893 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:32:59,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.28888888888889) internal successors, (463), 45 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-05-20 04:32:59,894 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:33:30,247 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 66 DAG size of output: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 04:33:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-05-20 04:33:57,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-05-20 04:33:57,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:33:57,208 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:33:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:33:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash -188831684, now seen corresponding path program 2 times [2023-05-20 04:33:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:33:57,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858919160] [2023-05-20 04:33:57,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:33:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:33:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:33:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-20 04:33:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:33:58,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858919160] [2023-05-20 04:33:58,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858919160] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:33:58,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322978610] [2023-05-20 04:33:58,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:33:58,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:33:58,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:33:58,623 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:33:58,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-05-20 04:33:58,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:33:58,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:33:58,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 56 conjunts are in the unsatisfiable core [2023-05-20 04:33:58,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:33:58,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:33:59,232 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:33:59,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:33:59,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:33:59,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:33:59,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-20 04:33:59,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:33:59,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:33:59,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 04:33:59,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:33:59,918 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-05-20 04:33:59,918 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-05-20 04:34:00,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:34:00,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:00,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-20 04:34:00,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:00,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-20 04:34:00,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:00,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-05-20 04:34:01,006 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:34:01,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:34:01,047 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 22 treesize of output 17 [2023-05-20 04:34:01,195 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 25 treesize of output 21 [2023-05-20 04:34:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-20 04:34:01,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:34:01,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2502 Int) (v_ArrVal_2504 Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2499) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2504) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (let ((.cse1 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2501))) (store .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2502))) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))))) is different from false [2023-05-20 04:34:02,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:02,665 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 94 [2023-05-20 04:34:02,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:02,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5563 treesize of output 5471 [2023-05-20 04:34:02,709 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 6510 treesize of output 5698 [2023-05-20 04:34:02,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:02,742 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 6223 treesize of output 5920 [2023-05-20 04:34:03,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-20 04:34:03,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:03,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 223 [2023-05-20 04:34:05,157 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2499 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int) (v_ArrVal_2504 Int)) (let ((.cse1 (* |t_funThread3of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (= .cse0 .cse1) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2499) |c_~#a~0.base|) (+ .cse1 |~#a~0.offset|) v_ArrVal_2504) (+ .cse0 |~#a~0.offset|)) 0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2499 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int) (v_ArrVal_2504 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2499) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2504) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-05-20 04:34:14,526 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 34 treesize of output 28 [2023-05-20 04:34:14,546 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:34:14,548 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 13 treesize of output 7 [2023-05-20 04:34:16,648 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-20 04:34:16,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-20 04:34:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 239 trivial. 64 not checked. [2023-05-20 04:34:16,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322978610] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:34:16,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:34:16,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 23] total 58 [2023-05-20 04:34:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485085736] [2023-05-20 04:34:16,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:34:16,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-20 04:34:16,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:34:16,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-20 04:34:16,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2721, Unknown=12, NotChecked=218, Total=3306 [2023-05-20 04:34:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:34:16,659 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:34:16,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 8.241379310344827) internal successors, (478), 58 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:34:16,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:34:16,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:34:16,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:34:16,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:34:16,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:34:16,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:34:16,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 04:34:16,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2023-05-20 04:34:16,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:34:28,859 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 41 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:34:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:34:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:34:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:34:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:34:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:34:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:34:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 04:34:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2023-05-20 04:34:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-05-20 04:34:36,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-05-20 04:34:37,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2023-05-20 04:34:37,073 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:34:37,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:34:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1235736660, now seen corresponding path program 3 times [2023-05-20 04:34:37,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:34:37,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605504793] [2023-05-20 04:34:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:34:37,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:34:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:34:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 46 proven. 24 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-20 04:34:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:34:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605504793] [2023-05-20 04:34:38,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605504793] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:34:38,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84209081] [2023-05-20 04:34:38,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 04:34:38,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:34:38,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:34:38,838 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:34:38,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-05-20 04:34:39,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-05-20 04:34:39,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:34:39,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 57 conjunts are in the unsatisfiable core [2023-05-20 04:34:39,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:34:39,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:34:39,899 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:34:39,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:34:39,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:34:40,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:34:40,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-20 04:34:40,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:34:40,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:40,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 04:34:40,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:34:40,573 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-05-20 04:34:40,574 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-05-20 04:34:40,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:34:41,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:41,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-20 04:34:41,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:41,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-05-20 04:34:41,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:41,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-05-20 04:34:41,662 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 22 treesize of output 17 [2023-05-20 04:34:41,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:34:41,735 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 19 treesize of output 21 [2023-05-20 04:34:41,806 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:34:41,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:34:41,882 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 25 treesize of output 21 [2023-05-20 04:34:41,955 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-20 04:34:41,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:34:42,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2622 (Array Int Int)) (v_ArrVal_2629 (Array Int Int)) (v_ArrVal_2626 Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (not (= (select (select (store (let ((.cse0 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2624))) (store .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2626))) |c_~#__global_lock~0.base| v_ArrVal_2629) |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| 4)) 0)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2628) (+ .cse1 |c_~#a~0.offset|)) 0)))) is different from false [2023-05-20 04:34:43,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int) (v_ArrVal_2618 (Array Int Int)) (v_ArrVal_2629 (Array Int Int)) (v_ArrVal_2626 Int)) (let ((.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28)) (.cse3 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2618))) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse4 (select .cse3 |c_~#a~0.base|)) (.cse5 (+ .cse0 4 |~#a~0.offset|))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_2628) (+ .cse1 |~#a~0.offset|)) 0) (not (= (select (select (store (let ((.cse2 (store (store .cse3 |c_~#a~0.base| (store .cse4 .cse5 1)) |c_~#__global_lock~0.base| v_ArrVal_2624))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2626))) |c_~#__global_lock~0.base| v_ArrVal_2629) |c_~#a~0.base|) (+ .cse1 4 |~#a~0.offset|)) 0)) (not (= (select .cse4 .cse5) 0)))))) is different from false [2023-05-20 04:34:43,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:43,320 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 97 [2023-05-20 04:34:43,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:43,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20347 treesize of output 20151 [2023-05-20 04:34:43,399 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 20102 treesize of output 17190 [2023-05-20 04:34:43,476 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 18278 treesize of output 17102 [2023-05-20 04:34:43,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:43,563 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 25035 treesize of output 23556 [2023-05-20 04:34:44,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-20 04:34:44,182 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:34:44,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 226 treesize of output 223 [2023-05-20 04:34:44,291 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2628) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)))) (.cse1 (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse3 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse2 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ .cse2 |~#a~0.offset|) v_ArrVal_2628) (+ .cse3 |~#a~0.offset|)) 0) (= .cse3 .cse2)))))) (and (or (and .cse0 .cse1) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) .cse0 .cse1)) is different from false [2023-05-20 04:34:46,475 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_2628) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0))) (forall ((v_ArrVal_2628 Int) (|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2622 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2622) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_2628) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0))))) is different from false [2023-05-20 04:34:49,778 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:34:49,780 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 13 treesize of output 7 [2023-05-20 04:34:49,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:34:51,867 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-20 04:34:51,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-20 04:34:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 79 not checked. [2023-05-20 04:34:51,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84209081] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:34:51,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:34:51,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22, 25] total 62 [2023-05-20 04:34:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549339627] [2023-05-20 04:34:51,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:34:51,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-05-20 04:34:51,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:34:51,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-05-20 04:34:51,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=2883, Unknown=23, NotChecked=460, Total=3782 [2023-05-20 04:34:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:34:51,882 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:34:51,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 7.82258064516129) internal successors, (485), 62 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:34:51,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:34:51,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:34:51,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:34:51,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:34:51,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:34:51,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:34:51,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 04:34:51,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2023-05-20 04:34:51,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-05-20 04:34:51,883 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:35:12,133 WARN L233 SmtUtils]: Spent 20.16s on a formula simplification. DAG size of input: 46 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:35:30,288 WARN L233 SmtUtils]: Spent 18.11s on a formula simplification. DAG size of input: 42 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:36:06,612 WARN L233 SmtUtils]: Spent 34.24s on a formula simplification. DAG size of input: 47 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:36:27,838 WARN L233 SmtUtils]: Spent 18.09s on a formula simplification. DAG size of input: 64 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:37:02,399 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 52 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:37:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:37:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:37:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:37:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:37:09,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-05-20 04:37:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-05-20 04:37:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-20 04:37:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-05-20 04:37:09,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-05-20 04:37:09,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:37:09,349 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:37:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:37:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1847986836, now seen corresponding path program 2 times [2023-05-20 04:37:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:37:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052557646] [2023-05-20 04:37:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:37:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:37:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:37:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2023-05-20 04:37:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:37:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052557646] [2023-05-20 04:37:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052557646] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:37:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053713733] [2023-05-20 04:37:10,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 04:37:10,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:37:10,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:37:10,068 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:37:10,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-05-20 04:37:10,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 04:37:10,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:37:10,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 46 conjunts are in the unsatisfiable core [2023-05-20 04:37:10,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:37:10,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:37:10,635 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:37:10,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:37:10,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:37:10,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:37:10,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:37:10,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:37:11,032 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 16 treesize of output 12 [2023-05-20 04:37:11,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:37:11,479 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 19 treesize of output 21 [2023-05-20 04:37:11,520 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:37:11,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:37:11,620 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 22 treesize of output 17 [2023-05-20 04:37:11,719 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 20 treesize of output 22 [2023-05-20 04:37:11,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-05-20 04:37:11,854 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 25 treesize of output 21 [2023-05-20 04:37:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-20 04:37:11,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:37:11,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_2764) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-05-20 04:37:12,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_2759 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2759) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))) (forall ((v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (= (select (let ((.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764)) (+ .cse0 |c_~#a~0.offset|)) 0))))) is different from false [2023-05-20 04:37:12,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:37:12,379 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2023-05-20 04:37:12,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:37:12,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2023-05-20 04:37:12,393 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 25 treesize of output 18 [2023-05-20 04:37:12,417 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)))) (let ((.cse3 (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)))) (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int)) (let ((.cse2 (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764) .cse2) 0) (= .cse2 |c_t_funThread3of4ForFork0_~p~0#1.offset|)))) (or .cse3 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (or .cse3 (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))))) is different from false [2023-05-20 04:37:12,430 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse1 (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764)) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0))) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse4 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse3 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse2 (+ .cse3 |~#a~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse2 v_ArrVal_2761)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse2 v_ArrVal_2764)) (+ .cse4 |~#a~0.offset|)) 0) (= .cse4 .cse3)))))) is different from false [2023-05-20 04:37:12,534 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2756 (Array Int Int)) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (let ((.cse1 (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2756))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) .cse1 v_ArrVal_2761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse1 v_ArrVal_2764)) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2756 (Array Int Int)) (v_ArrVal_2761 Int) (v_ArrVal_2762 (Array Int Int)) (v_ArrVal_2764 Int) (|~#a~0.offset| Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse5 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse4 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (let ((.cse3 (+ .cse4 |~#a~0.offset|))) (store (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2756))) (store .cse2 |c_~#a~0.base| (store (select .cse2 |c_~#a~0.base|) .cse3 v_ArrVal_2761))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2762) |c_~#a~0.base|) .cse3 v_ArrVal_2764)) (+ .cse5 |~#a~0.offset|)) 0) (= .cse5 .cse4))))) is different from false [2023-05-20 04:37:21,211 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:37:30,457 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:37:30,466 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 123 treesize of output 111 [2023-05-20 04:37:30,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:37:30,470 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 47 treesize of output 41 [2023-05-20 04:37:30,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:37:32,584 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-20 04:37:32,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-20 04:37:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 38 not checked. [2023-05-20 04:37:32,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053713733] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:37:32,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:37:32,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 21] total 45 [2023-05-20 04:37:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541368533] [2023-05-20 04:37:32,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:37:32,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-05-20 04:37:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:37:32,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-05-20 04:37:32,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1350, Unknown=18, NotChecked=400, Total=1980 [2023-05-20 04:37:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:37:32,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:37:32,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 10.2) internal successors, (459), 45 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-05-20 04:37:32,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:37:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:37:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:37:56,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:37:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:37:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-05-20 04:37:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2023-05-20 04:37:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-05-20 04:37:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-05-20 04:37:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-05-20 04:37:56,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-05-20 04:37:56,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2023-05-20 04:37:56,563 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:37:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:37:56,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1002877638, now seen corresponding path program 1 times [2023-05-20 04:37:56,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:37:56,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282144658] [2023-05-20 04:37:56,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:37:56,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:37:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:37:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-05-20 04:37:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:37:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282144658] [2023-05-20 04:37:56,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282144658] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:37:56,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888955570] [2023-05-20 04:37:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:37:56,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:37:56,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:37:56,726 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:37:56,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-05-20 04:37:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:37:56,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 04:37:56,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:37:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-05-20 04:37:57,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:37:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2023-05-20 04:37:57,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888955570] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:37:57,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:37:57,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2023-05-20 04:37:57,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282164148] [2023-05-20 04:37:57,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:37:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-05-20 04:37:57,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:37:57,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-05-20 04:37:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2023-05-20 04:37:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:37:57,152 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:37:57,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 13.772727272727273) internal successors, (303), 22 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 125 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-05-20 04:37:57,152 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2023-05-20 04:37:57,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2023-05-20 04:37:57,153 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:38:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-05-20 04:38:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-20 04:38:12,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-05-20 04:38:12,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-05-20 04:38:12,425 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:38:12,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:38:12,425 INFO L85 PathProgramCache]: Analyzing trace with hash 143598486, now seen corresponding path program 4 times [2023-05-20 04:38:12,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:38:12,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366832823] [2023-05-20 04:38:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:38:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:38:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:38:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-20 04:38:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:38:14,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366832823] [2023-05-20 04:38:14,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366832823] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:38:14,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117424751] [2023-05-20 04:38:14,065 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-05-20 04:38:14,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:38:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:38:14,067 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:38:14,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-05-20 04:38:14,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-05-20 04:38:14,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:38:14,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 55 conjunts are in the unsatisfiable core [2023-05-20 04:38:14,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:38:14,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:38:14,700 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:38:14,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:38:14,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:38:14,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:38:14,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-20 04:38:15,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:38:15,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:38:15,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 04:38:15,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:38:15,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:38:16,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:38:16,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 04:38:16,106 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-05-20 04:38:16,106 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2023-05-20 04:38:16,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 04:38:16,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2023-05-20 04:38:16,258 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:38:16,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:38:16,329 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 22 treesize of output 17 [2023-05-20 04:38:16,401 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 25 treesize of output 21 [2023-05-20 04:38:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2023-05-20 04:38:16,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:38:16,692 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3004 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_3004) (+ (* |c_t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3002 Int)) (let ((.cse1 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2998))) (let ((.cse2 (select .cse1 |c_t_funThread4of4ForFork0_~p~0#1.base|)) (.cse3 (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select (select (let ((.cse0 (store .cse1 |c_t_funThread4of4ForFork0_~p~0#1.base| (store .cse2 .cse3 1)))) (store .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_3002))) |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)) 0)) (not (= (select .cse2 .cse3) 0))))))) is different from false [2023-05-20 04:38:16,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int)) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (forall ((v_ArrVal_3004 Int)) (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_3004) (+ .cse0 |c_~#a~0.offset|)) 0)) (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3002 Int)) (let ((.cse4 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2998))) (let ((.cse1 (select .cse4 |c_~#a~0.base|)) (.cse2 (+ .cse0 |c_~#a~0.offset| 4))) (or (not (= (select .cse1 .cse2) 0)) (not (= (select (select (let ((.cse3 (store .cse4 |c_~#a~0.base| (store .cse1 .cse2 1)))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_3002))) |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)) 0))))))))) is different from false [2023-05-20 04:38:16,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2998 (Array Int Int)) (v_ArrVal_2997 (Array Int Int)) (v_ArrVal_3004 Int) (v_ArrVal_3002 Int)) (let ((.cse4 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse3 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2998))) (let ((.cse0 (select .cse3 |c_~#a~0.base|)) (.cse1 (+ .cse4 |c_~#a~0.offset| 4))) (or (not (= (select .cse0 .cse1) 0)) (not (= (select (select (let ((.cse2 (store .cse3 |c_~#a~0.base| (store .cse0 .cse1 1)))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_3002))) |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) v_ArrVal_3004) (+ .cse4 |c_~#a~0.offset|)) 0))))) is different from false [2023-05-20 04:38:17,733 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:38:17,733 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 88 [2023-05-20 04:38:17,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:38:17,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1011 treesize of output 983 [2023-05-20 04:38:17,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 04:38:17,758 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 1499 treesize of output 1364 [2023-05-20 04:38:17,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-20 04:38:17,904 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-05-20 04:38:17,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 153 [2023-05-20 04:38:20,007 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_3004) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0))))) is different from false [2023-05-20 04:38:22,118 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_3004) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-05-20 04:38:22,144 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t_funThread1of4ForFork0_assume_abort_if_not_~cond#1| 0) (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (or (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ (* |t_funThread3of4ForFork0_~i~0#1| 28) |~#a~0.offset|) v_ArrVal_3004) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-05-20 04:38:28,322 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 31 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:38:28,342 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_2997 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_3004 Int) (|t_funThread3of4ForFork0_~i~0#1| Int)) (let ((.cse1 (* |t_funThread4of4ForFork0_~i~0#1| 28)) (.cse0 (* |t_funThread3of4ForFork0_~i~0#1| 28))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2997) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|) v_ArrVal_3004) (+ .cse1 |~#a~0.offset|)) 0) (= .cse1 .cse0)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-05-20 04:38:40,493 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:38:40,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 04:38:40,503 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 13 treesize of output 7 [2023-05-20 04:38:42,563 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-05-20 04:38:42,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2023-05-20 04:38:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 68 not checked. [2023-05-20 04:38:42,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117424751] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:38:42,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:38:42,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 24] total 59 [2023-05-20 04:38:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911735662] [2023-05-20 04:38:42,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:38:42,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-05-20 04:38:42,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:38:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-05-20 04:38:42,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=2320, Unknown=20, NotChecked=742, Total=3422 [2023-05-20 04:38:42,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:38:42,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:38:42,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 8.084745762711865) internal successors, (477), 59 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 135 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-20 04:38:42,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-05-20 04:38:42,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-05-20 04:38:42,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-20 04:38:42,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:39:00,800 WARN L233 SmtUtils]: Spent 18.12s on a formula simplification. DAG size of input: 39 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:39:51,267 WARN L233 SmtUtils]: Spent 50.26s on a formula simplification. DAG size of input: 49 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-20 04:40:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-05-20 04:40:01,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-05-20 04:40:01,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-05-20 04:40:01,267 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:40:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:40:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1714709394, now seen corresponding path program 5 times [2023-05-20 04:40:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:40:01,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807060986] [2023-05-20 04:40:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:40:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:40:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 04:40:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-20 04:40:02,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 04:40:02,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807060986] [2023-05-20 04:40:02,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807060986] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 04:40:02,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966670761] [2023-05-20 04:40:02,140 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-05-20 04:40:02,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 04:40:02,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 04:40:02,141 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 04:40:02,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-05-20 04:40:03,074 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-05-20 04:40:03,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 04:40:03,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-20 04:40:03,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 04:40:03,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-05-20 04:40:03,326 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 04:40:03,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 04:40:03,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:40:03,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:40:03,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:40:03,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:40:03,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-05-20 04:40:04,231 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 16 treesize of output 12 [2023-05-20 04:40:04,275 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-05-20 04:40:04,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2023-05-20 04:40:04,417 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 22 treesize of output 17 [2023-05-20 04:40:04,519 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 25 treesize of output 21 [2023-05-20 04:40:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2023-05-20 04:40:04,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 04:40:04,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-05-20 04:40:08,967 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_3116 (Array Int Int))) (let ((.cse0 (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3116) |c_~#a~0.base|) .cse0) 0) (= .cse0 |c_t_funThread3of4ForFork0_~p~0#1.offset|)))) (= (+ |c_~#a~0.offset| (* |c_t_funThread3of4ForFork0_~i~0#1| 28)) |c_t_funThread3of4ForFork0_~p~0#1.offset|) (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) is different from false [2023-05-20 04:40:09,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (|~#a~0.offset| Int) (v_ArrVal_3116 (Array Int Int))) (let ((.cse0 (* |t_funThread4of4ForFork0_~i~0#1| 28))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3116) |c_~#a~0.base|) (+ .cse0 |~#a~0.offset|)) 0) (= .cse0 (* |c_t_funThread3of4ForFork0_~i~0#1| 28))))) is different from false [2023-05-20 04:40:11,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread4of4ForFork0_~i~0#1| Int) (v_ArrVal_3116 (Array Int Int)) (|~#a~0.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_3116) |c_~#a~0.base|) (+ (* |t_funThread4of4ForFork0_~i~0#1| 28) |~#a~0.offset|)) 0)) is different from false [2023-05-20 04:40:11,695 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 13 treesize of output 7 [2023-05-20 04:40:11,725 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 04:40:11,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2023-05-20 04:40:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 38 not checked. [2023-05-20 04:40:11,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966670761] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 04:40:11,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 04:40:11,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 41 [2023-05-20 04:40:11,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900328143] [2023-05-20 04:40:11,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 04:40:11,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-05-20 04:40:11,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 04:40:11,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-05-20 04:40:11,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1233, Unknown=3, NotChecked=222, Total=1640 [2023-05-20 04:40:11,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:40:11,729 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 04:40:11,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.414634146341463) internal successors, (386), 41 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 135 states. [2023-05-20 04:40:11,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-05-20 04:40:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-05-20 04:40:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-05-20 04:40:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-20 04:40:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2023-05-20 04:40:11,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 04:40:25,929 WARN L233 SmtUtils]: Spent 14.11s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:40:34,155 WARN L233 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 46 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:40:42,290 WARN L233 SmtUtils]: Spent 8.08s on a formula simplification. DAG size of input: 51 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2023-05-20 04:40:54,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-05-20 04:40:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-05-20 04:40:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-05-20 04:40:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-20 04:40:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-05-20 04:40:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-05-20 04:40:54,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-05-20 04:40:55,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-05-20 04:40:55,161 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 04:40:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 04:40:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1857624964, now seen corresponding path program 6 times [2023-05-20 04:40:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 04:40:55,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692165270] [2023-05-20 04:40:55,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 04:40:55,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 04:40:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat