/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/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 07:35:15,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 07:35:15,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 07:35:15,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 07:35:15,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 07:35:15,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 07:35:15,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 07:35:15,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 07:35:15,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 07:35:15,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 07:35:15,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 07:35:15,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 07:35:15,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 07:35:15,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 07:35:15,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 07:35:15,363 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 07:35:15,363 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 07:35:15,364 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 07:35:15,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 07:35:15,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 07:35:15,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 07:35:15,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 07:35:15,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 07:35:15,375 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 07:35:15,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 07:35:15,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 07:35:15,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 07:35:15,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 07:35:15,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 07:35:15,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 07:35:15,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 07:35:15,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 07:35:15,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 07:35:15,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 07:35:15,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 07:35:15,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 07:35:15,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 07:35:15,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 07:35:15,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 07:35:15,392 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 07:35:15,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 07:35:15,398 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 07:35:15,431 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 07:35:15,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 07:35:15,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 07:35:15,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 07:35:15,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 07:35:15,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 07:35:15,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 07:35:15,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 07:35:15,434 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 07:35:15,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 07:35:15,435 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 07:35:15,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 07:35:15,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 07:35:15,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 07:35:15,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 07:35:15,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 07:35:15,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 07:35:15,436 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 07:35:15,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 07:35:15,436 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 07:35:15,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 07:35:15,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 07:35:15,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 07:35:15,436 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 07:35:15,436 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 07:35:15,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 07:35:15,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 07:35:15,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 07:35:15,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 07:35:15,438 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 07:35:15,438 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 07:35:15,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 07:35:15,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 07:35:15,439 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 07:35:15,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 07:35:15,439 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 07:35:15,439 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-04 07:35:15,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 07:35:15,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 07:35:15,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 07:35:15,689 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 07:35:15,690 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 07:35:15,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2023-05-04 07:35:15,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6765194/52fea19805fc4b09b0c6cb6e6db32f56/FLAG224540a19 [2023-05-04 07:35:16,296 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 07:35:16,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2023-05-04 07:35:16,314 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6765194/52fea19805fc4b09b0c6cb6e6db32f56/FLAG224540a19 [2023-05-04 07:35:16,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b6765194/52fea19805fc4b09b0c6cb6e6db32f56 [2023-05-04 07:35:16,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 07:35:16,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 07:35:16,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 07:35:16,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 07:35:16,774 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 07:35:16,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:35:16" (1/1) ... [2023-05-04 07:35:16,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b189257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:16, skipping insertion in model container [2023-05-04 07:35:16,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 07:35:16" (1/1) ... [2023-05-04 07:35:16,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 07:35:16,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 07:35:17,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2023-05-04 07:35:17,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2023-05-04 07:35:17,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2023-05-04 07:35:17,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 07:35:17,239 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 07:35:17,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2023-05-04 07:35:17,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2023-05-04 07:35:17,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2023-05-04 07:35:17,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 07:35:17,331 INFO L208 MainTranslator]: Completed translation [2023-05-04 07:35:17,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17 WrapperNode [2023-05-04 07:35:17,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 07:35:17,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 07:35:17,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 07:35:17,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 07:35:17,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,412 INFO L138 Inliner]: procedures = 274, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2023-05-04 07:35:17,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 07:35:17,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 07:35:17,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 07:35:17,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 07:35:17,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,457 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 07:35:17,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 07:35:17,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 07:35:17,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 07:35:17,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (1/1) ... [2023-05-04 07:35:17,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 07:35:17,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 07:35:17,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 07:35:17,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 07:35:17,543 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 07:35:17,544 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 07:35:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 07:35:17,544 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 07:35:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 07:35:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 07:35:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 07:35:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 07:35:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 07:35:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 07:35:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 07:35:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 07:35:17,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 07:35:17,546 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 07:35:17,723 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 07:35:17,726 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 07:35:18,077 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 07:35:18,086 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 07:35:18,087 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 07:35:18,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:35:18 BoogieIcfgContainer [2023-05-04 07:35:18,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 07:35:18,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 07:35:18,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 07:35:18,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 07:35:18,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 07:35:16" (1/3) ... [2023-05-04 07:35:18,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc8cf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:35:18, skipping insertion in model container [2023-05-04 07:35:18,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 07:35:17" (2/3) ... [2023-05-04 07:35:18,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc8cf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 07:35:18, skipping insertion in model container [2023-05-04 07:35:18,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 07:35:18" (3/3) ... [2023-05-04 07:35:18,100 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2023-05-04 07:35:18,107 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 07:35:18,120 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 07:35:18,121 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 07:35:18,121 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 07:35:18,238 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 07:35:18,313 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 07:35:18,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 07:35:18,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 07:35:18,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 07:35:18,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 07:35:18,349 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 07:35:18,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 07:35:18,382 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;@1eedfdf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 07:35:18,382 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 07:35:18,647 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:18,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash 345256880, now seen corresponding path program 1 times [2023-05-04 07:35:18,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:18,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531686036] [2023-05-04 07:35:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:18,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:19,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531686036] [2023-05-04 07:35:19,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531686036] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:19,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:19,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 07:35:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084242605] [2023-05-04 07:35:19,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:19,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 07:35:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 07:35:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 07:35:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,067 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:19,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 69.5) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:19,068 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 07:35:19,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:19,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1355483599, now seen corresponding path program 1 times [2023-05-04 07:35:19,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:19,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854991888] [2023-05-04 07:35:19,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:19,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:19,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:19,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854991888] [2023-05-04 07:35:19,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854991888] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:19,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:19,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 07:35:19,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068197824] [2023-05-04 07:35:19,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:19,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 07:35:19,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 07:35:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 07:35:19,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:19,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:19,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:19,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 07:35:19,508 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1842954812, now seen corresponding path program 1 times [2023-05-04 07:35:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:19,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366788304] [2023-05-04 07:35:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:19,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366788304] [2023-05-04 07:35:19,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366788304] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:19,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:19,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 07:35:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491136060] [2023-05-04 07:35:19,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:19,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 07:35:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:19,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 07:35:19,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 07:35:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,842 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:19,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:19,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:19,842 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:19,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 07:35:19,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:19,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2085131728, now seen corresponding path program 1 times [2023-05-04 07:35:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:19,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766695334] [2023-05-04 07:35:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:20,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:20,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766695334] [2023-05-04 07:35:20,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766695334] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:20,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:20,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 07:35:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120460363] [2023-05-04 07:35:20,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:20,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 07:35:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 07:35:20,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 07:35:20,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:20,042 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:20,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:20,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:20,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:20,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:20,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:20,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 07:35:20,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash 926448272, now seen corresponding path program 1 times [2023-05-04 07:35:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:20,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461761339] [2023-05-04 07:35:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:20,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461761339] [2023-05-04 07:35:20,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461761339] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:20,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:20,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 07:35:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614582023] [2023-05-04 07:35:20,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:20,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 07:35:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:20,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 07:35:20,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 07:35:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:20,887 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:20,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.5) internal successors, (138), 12 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:20,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:20,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:20,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:20,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:20,888 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:21,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 07:35:21,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash -215361403, now seen corresponding path program 1 times [2023-05-04 07:35:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:21,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748997891] [2023-05-04 07:35:21,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:21,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:24,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748997891] [2023-05-04 07:35:24,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748997891] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:24,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:24,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 07:35:24,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928598630] [2023-05-04 07:35:24,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:24,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 07:35:24,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:24,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 07:35:24,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2023-05-04 07:35:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:24,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:24,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.793103448275862) internal successors, (139), 29 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:24,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:24,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:24,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:24,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:24,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:24,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 07:35:26,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 07:35:26,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1346933330, now seen corresponding path program 1 times [2023-05-04 07:35:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:26,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966862513] [2023-05-04 07:35:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:26,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:26,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966862513] [2023-05-04 07:35:26,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966862513] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:26,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:26,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 07:35:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416194775] [2023-05-04 07:35:26,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 07:35:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 07:35:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 07:35:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:26,974 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:26,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:26,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:26,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:26,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:26,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:26,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:26,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 07:35:26,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:27,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 07:35:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:27,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 07:35:27,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:27,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1507188205, now seen corresponding path program 1 times [2023-05-04 07:35:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:27,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467828141] [2023-05-04 07:35:27,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:27,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:29,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:29,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467828141] [2023-05-04 07:35:29,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467828141] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:29,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:29,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-05-04 07:35:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291113749] [2023-05-04 07:35:29,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:29,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-04 07:35:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-04 07:35:29,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2023-05-04 07:35:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:29,694 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:29,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.4) internal successors, (132), 30 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-04 07:35:29,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:29,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:29,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:29,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:29,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:29,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 07:35:29,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:29,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:32,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 07:35:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 07:35:32,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 07:35:32,262 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:32,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:32,262 INFO L85 PathProgramCache]: Analyzing trace with hash 518996261, now seen corresponding path program 1 times [2023-05-04 07:35:32,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:32,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310701207] [2023-05-04 07:35:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:32,371 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-04 07:35:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:32,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310701207] [2023-05-04 07:35:32,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310701207] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 07:35:32,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091388472] [2023-05-04 07:35:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:32,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 07:35:32,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 07:35:32,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 07:35:32,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-04 07:35:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:32,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 4 conjunts are in the unsatisfiable core [2023-05-04 07:35:32,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 07:35:32,688 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-04 07:35:32,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 07:35:32,758 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-04 07:35:32,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091388472] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 07:35:32,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 07:35:32,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-05-04 07:35:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184261071] [2023-05-04 07:35:32,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 07:35:32,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-05-04 07:35:32,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:32,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-05-04 07:35:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-05-04 07:35:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:32,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:32,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.7) internal successors, (277), 10 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 07:35:32,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:32,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 07:35:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 07:35:32,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 07:35:32,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-04 07:35:33,065 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,SelfDestructingSolverStorable8 [2023-05-04 07:35:33,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:33,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 179176582, now seen corresponding path program 1 times [2023-05-04 07:35:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:33,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182157402] [2023-05-04 07:35:33,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182157402] [2023-05-04 07:35:33,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182157402] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:33,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:33,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 07:35:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823290145] [2023-05-04 07:35:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:33,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 07:35:33,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 07:35:33,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 07:35:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:33,188 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:33,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 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-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 07:35:33,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 07:35:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-05-04 07:35:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 07:35:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:33,527 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 07:35:33,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 07:35:33,532 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 07:35:33,533 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 07:35:33,542 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 07:35:33,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 07:35:33,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 07:35:33,543 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 07:35:33,549 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 07:35:33,551 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 07:35:33,552 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;@1eedfdf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 07:35:33,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 07:35:33,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-05-04 07:35:33,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 07:35:33,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash 935827827, now seen corresponding path program 1 times [2023-05-04 07:35:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:33,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317211006] [2023-05-04 07:35:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:33,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317211006] [2023-05-04 07:35:33,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317211006] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:33,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:33,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 07:35:33,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477806616] [2023-05-04 07:35:33,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:33,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 07:35:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 07:35:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 07:35:33,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:33,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:33,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:33,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:33,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 07:35:33,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 07:35:33,802 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 07:35:33,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 07:35:33,805 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 07:35:33,805 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 07:35:33,809 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 07:35:33,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 07:35:33,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 07:35:33,850 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 07:35:33,854 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 07:35:33,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 07:35:33,856 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;@1eedfdf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 07:35:33,856 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 07:35:33,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2023-05-04 07:35:33,950 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash -249696791, now seen corresponding path program 1 times [2023-05-04 07:35:33,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:33,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576815877] [2023-05-04 07:35:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:34,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576815877] [2023-05-04 07:35:34,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576815877] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:34,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:34,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 07:35:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254249238] [2023-05-04 07:35:34,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:34,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 07:35:34,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:34,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 07:35:34,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 07:35:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:34,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:34,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:34,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:34,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:34,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 07:35:34,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:34,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1495935330, now seen corresponding path program 1 times [2023-05-04 07:35:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:34,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963174416] [2023-05-04 07:35:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:34,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 07:35:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:34,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963174416] [2023-05-04 07:35:34,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963174416] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:34,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:34,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 07:35:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632628300] [2023-05-04 07:35:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:34,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 07:35:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 07:35:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 07:35:34,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:34,221 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:34,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 07:35:34,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:34,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:34,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 07:35:34,280 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1088180183, now seen corresponding path program 1 times [2023-05-04 07:35:34,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:34,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584318674] [2023-05-04 07:35:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:34,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 07:35:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-05-04 07:35:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 07:35:34,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584318674] [2023-05-04 07:35:34,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584318674] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 07:35:34,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 07:35:34,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 07:35:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727900099] [2023-05-04 07:35:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 07:35:34,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 07:35:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 07:35:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 07:35:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 07:35:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:34,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 07:35:34,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.333333333333332) internal successors, (220), 12 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-04 07:35:34,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:34,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:34,933 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 07:35:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 07:35:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 07:35:35,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 07:35:35,334 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 07:35:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 07:35:35,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1235249932, now seen corresponding path program 1 times [2023-05-04 07:35:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 07:35:35,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82449691] [2023-05-04 07:35:35,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 07:35:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 07:35:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 07:35:35,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 07:35:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 07:35:35,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 07:35:35,556 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 07:35:35,557 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 07:35:35,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-04 07:35:35,558 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-05-04 07:35:35,558 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2023-05-04 07:35:35,561 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 07:35:35,561 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 07:35:35,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 07:35:35 BasicIcfg [2023-05-04 07:35:35,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 07:35:35,775 INFO L158 Benchmark]: Toolchain (without parser) took 19008.44ms. Allocated memory was 202.4MB in the beginning and 558.9MB in the end (delta: 356.5MB). Free memory was 169.8MB in the beginning and 380.1MB in the end (delta: -210.3MB). Peak memory consumption was 338.9MB. Max. memory is 8.0GB. [2023-05-04 07:35:35,775 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 07:35:35,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.37ms. Allocated memory was 202.4MB in the beginning and 252.7MB in the end (delta: 50.3MB). Free memory was 169.5MB in the beginning and 199.6MB in the end (delta: -30.0MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2023-05-04 07:35:35,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.91ms. Allocated memory is still 252.7MB. Free memory was 199.6MB in the beginning and 196.6MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 07:35:35,775 INFO L158 Benchmark]: Boogie Preprocessor took 48.39ms. Allocated memory is still 252.7MB. Free memory was 196.2MB in the beginning and 194.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 07:35:35,776 INFO L158 Benchmark]: RCFGBuilder took 626.47ms. Allocated memory is still 252.7MB. Free memory was 194.1MB in the beginning and 170.7MB in the end (delta: 23.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-05-04 07:35:35,776 INFO L158 Benchmark]: TraceAbstraction took 17683.52ms. Allocated memory was 252.7MB in the beginning and 558.9MB in the end (delta: 306.2MB). Free memory was 169.7MB in the beginning and 380.1MB in the end (delta: -210.5MB). Peak memory consumption was 289.1MB. Max. memory is 8.0GB. [2023-05-04 07:35:35,777 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory is still 155.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 564.37ms. Allocated memory was 202.4MB in the beginning and 252.7MB in the end (delta: 50.3MB). Free memory was 169.5MB in the beginning and 199.6MB in the end (delta: -30.0MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.91ms. Allocated memory is still 252.7MB. Free memory was 199.6MB in the beginning and 196.6MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.39ms. Allocated memory is still 252.7MB. Free memory was 196.2MB in the beginning and 194.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 626.47ms. Allocated memory is still 252.7MB. Free memory was 194.1MB in the beginning and 170.7MB in the end (delta: 23.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 17683.52ms. Allocated memory was 252.7MB in the beginning and 558.9MB in the end (delta: 306.2MB). Free memory was 169.7MB in the beginning and 380.1MB in the end (delta: -210.5MB). Peak memory consumption was 289.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32212, independent: 31145, independent conditional: 17759, independent unconditional: 13386, dependent: 1067, dependent conditional: 992, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31287, independent: 31145, independent conditional: 17759, independent unconditional: 13386, dependent: 142, dependent conditional: 67, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31287, independent: 31145, independent conditional: 17759, independent unconditional: 13386, dependent: 142, dependent conditional: 67, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32011, independent: 31145, independent conditional: 186, independent unconditional: 30959, dependent: 866, dependent conditional: 538, dependent unconditional: 328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32011, independent: 31145, independent conditional: 186, independent unconditional: 30959, dependent: 866, dependent conditional: 96, dependent unconditional: 770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32011, independent: 31145, independent conditional: 186, independent unconditional: 30959, dependent: 866, dependent conditional: 96, dependent unconditional: 770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12172, independent: 12090, independent conditional: 25, independent unconditional: 12065, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12172, independent: 12061, independent conditional: 0, independent unconditional: 12061, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 294, independent: 130, independent conditional: 69, independent unconditional: 61, dependent: 163, dependent conditional: 20, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 32011, independent: 19055, independent conditional: 161, independent unconditional: 18894, dependent: 784, dependent conditional: 89, dependent unconditional: 695, unknown: 12172, unknown conditional: 32, unknown unconditional: 12140] , Statistics on independence cache: Total cache size (in pairs): 12172, Positive cache size: 12090, Positive conditional cache size: 25, Positive unconditional cache size: 12065, Negative cache size: 82, Negative conditional cache size: 7, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 442, Maximal queried relation: 8, Independence queries for same thread: 925 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.5s, Number of persistent set computation: 2727, Number of trivial persistent sets: 2653, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13461, independent: 13386, independent conditional: 0, independent unconditional: 13386, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 32212, independent: 31145, independent conditional: 17759, independent unconditional: 13386, dependent: 1067, dependent conditional: 992, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31287, independent: 31145, independent conditional: 17759, independent unconditional: 13386, dependent: 142, dependent conditional: 67, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31287, independent: 31145, independent conditional: 17759, independent unconditional: 13386, dependent: 142, dependent conditional: 67, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32011, independent: 31145, independent conditional: 186, independent unconditional: 30959, dependent: 866, dependent conditional: 538, dependent unconditional: 328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32011, independent: 31145, independent conditional: 186, independent unconditional: 30959, dependent: 866, dependent conditional: 96, dependent unconditional: 770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32011, independent: 31145, independent conditional: 186, independent unconditional: 30959, dependent: 866, dependent conditional: 96, dependent unconditional: 770, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12172, independent: 12090, independent conditional: 25, independent unconditional: 12065, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12172, independent: 12061, independent conditional: 0, independent unconditional: 12061, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 111, independent: 29, independent conditional: 25, independent unconditional: 4, dependent: 82, dependent conditional: 7, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 294, independent: 130, independent conditional: 69, independent unconditional: 61, dependent: 163, dependent conditional: 20, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 32011, independent: 19055, independent conditional: 161, independent unconditional: 18894, dependent: 784, dependent conditional: 89, dependent unconditional: 695, unknown: 12172, unknown conditional: 32, unknown unconditional: 12140] , Statistics on independence cache: Total cache size (in pairs): 12172, Positive cache size: 12090, Positive conditional cache size: 25, Positive unconditional cache size: 12065, Negative cache size: 82, Negative conditional cache size: 7, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 442, Maximal queried relation: 8, Independence queries for same thread: 925 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9063, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 313, dependent conditional: 234, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 20, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8441, independent: 8362, independent conditional: 0, independent unconditional: 8362, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8441, independent: 8358, independent conditional: 0, independent unconditional: 8358, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8889, independent: 388, independent conditional: 0, independent unconditional: 388, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8441, unknown conditional: 0, unknown unconditional: 8441] , Statistics on independence cache: Total cache size (in pairs): 8441, Positive cache size: 8362, Positive conditional cache size: 0, Positive unconditional cache size: 8362, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 194 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 307, Number of trivial persistent sets: 279, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8579, independent: 8500, independent conditional: 0, independent unconditional: 8500, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9063, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 313, dependent conditional: 234, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8869, independent: 8750, independent conditional: 250, independent unconditional: 8500, dependent: 119, dependent conditional: 40, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 20, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8889, independent: 8750, independent conditional: 0, independent unconditional: 8750, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8441, independent: 8362, independent conditional: 0, independent unconditional: 8362, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8441, independent: 8358, independent conditional: 0, independent unconditional: 8358, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8889, independent: 388, independent conditional: 0, independent unconditional: 388, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8441, unknown conditional: 0, unknown unconditional: 8441] , Statistics on independence cache: Total cache size (in pairs): 8441, Positive cache size: 8362, Positive conditional cache size: 0, Positive unconditional cache size: 8362, Negative cache size: 79, Negative conditional cache size: 0, Negative unconditional cache size: 79, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 1, Independence queries for same thread: 194 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14818, independent: 14402, independent conditional: 825, independent unconditional: 13577, dependent: 416, dependent conditional: 361, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14472, independent: 14402, independent conditional: 825, independent unconditional: 13577, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14472, independent: 14402, independent conditional: 825, independent unconditional: 13577, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14402, independent conditional: 0, independent unconditional: 14402, dependent: 100, dependent conditional: 30, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14502, independent: 14402, independent conditional: 0, independent unconditional: 14402, dependent: 100, dependent conditional: 11, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14502, independent: 14402, independent conditional: 0, independent unconditional: 14402, dependent: 100, dependent conditional: 11, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11382, independent: 11324, independent conditional: 0, independent unconditional: 11324, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11382, independent: 11319, independent conditional: 0, independent unconditional: 11319, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 69, dependent conditional: 4, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14502, independent: 3078, independent conditional: 0, independent unconditional: 3078, dependent: 42, dependent conditional: 8, dependent unconditional: 34, unknown: 11382, unknown conditional: 3, unknown unconditional: 11379] , Statistics on independence cache: Total cache size (in pairs): 11382, Positive cache size: 11324, Positive conditional cache size: 0, Positive unconditional cache size: 11324, Negative cache size: 58, Negative conditional cache size: 3, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 3, Independence queries for same thread: 346 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 332, Number of trivial persistent sets: 255, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13632, independent: 13577, independent conditional: 0, independent unconditional: 13577, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14818, independent: 14402, independent conditional: 825, independent unconditional: 13577, dependent: 416, dependent conditional: 361, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14472, independent: 14402, independent conditional: 825, independent unconditional: 13577, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14472, independent: 14402, independent conditional: 825, independent unconditional: 13577, dependent: 70, dependent conditional: 15, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14502, independent: 14402, independent conditional: 0, independent unconditional: 14402, dependent: 100, dependent conditional: 30, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14502, independent: 14402, independent conditional: 0, independent unconditional: 14402, dependent: 100, dependent conditional: 11, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14502, independent: 14402, independent conditional: 0, independent unconditional: 14402, dependent: 100, dependent conditional: 11, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11382, independent: 11324, independent conditional: 0, independent unconditional: 11324, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11382, independent: 11319, independent conditional: 0, independent unconditional: 11319, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 69, dependent conditional: 4, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 14502, independent: 3078, independent conditional: 0, independent unconditional: 3078, dependent: 42, dependent conditional: 8, dependent unconditional: 34, unknown: 11382, unknown conditional: 3, unknown unconditional: 11379] , Statistics on independence cache: Total cache size (in pairs): 11382, Positive cache size: 11324, Positive conditional cache size: 0, Positive unconditional cache size: 11324, Negative cache size: 58, Negative conditional cache size: 3, Negative unconditional cache size: 55, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 3, Independence queries for same thread: 346 - PositiveResult [Line: 1032]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1059]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [enqueue_flag=0] [L947] 0 pthread_mutex_t m; VAL [enqueue_flag=0, m={5:0}] [L951] 0 QType queue; VAL [enqueue_flag=0, m={5:0}, queue={6:0}] [L949] 0 int stored_elements[(20)]; VAL [enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L950] 0 _Bool enqueue_flag, dequeue_flag; VAL [dequeue_flag=0, enqueue_flag=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1054] 0 pthread_t id1, id2; VAL [dequeue_flag=0, enqueue_flag=0, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1055] 0 enqueue_flag=(1) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1056] 0 dequeue_flag=(0) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L955] 0 q->tail=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L956] 0 q->amount=0 VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 0 q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L960] COND TRUE 0 q->head == q->tail VAL [dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->tail=0, queue={6:0}, stored_elements={7:0}] [L963] 0 return (-1); VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) VAL [dequeue_flag=0, empty(&queue)=-1, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, pthread_create(&id1, ((void *)0), t1, &queue)=-1, queue={6:0}, stored_elements={7:0}] [L1007] 1 int value, i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1009] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1010] CALL 1 enqueue(&queue,value) [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, pthread_create(&id2, ((void *)0), t2, &queue)=0, queue={6:0}, stored_elements={7:0}] [L980] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L1036] 2 int i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1065] 0 \read(id1) VAL [\read(id1)=-1, dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L980] 1 q->element[q->tail] = x VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L981] EXPR 1 q->amount VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, queue={6:0}, stored_elements={7:0}, x=9] [L981] 1 q->amount++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=0, q->amount++=0, queue={6:0}, stored_elements={7:0}, x=9] [L982] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L988] EXPR 1 q->tail VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, queue={6:0}, stored_elements={7:0}, x=9] [L988] 1 q->tail++ VAL [\old(x)=9, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=0, q->tail++=0, queue={6:0}, stored_elements={7:0}, x=9] [L990] 1 return 0; VAL [\old(x)=9, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=9] [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue(&queue,value)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1013] 1 stored_elements[0]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L960] EXPR 1 q->tail VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L960] COND FALSE 1 !(q->head == q->tail) VAL [\result=-1, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, q->head=0, q->tail=1, queue={6:0}, stored_elements={7:0}] [L966] 1 return 0; VAL [\result=-1, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L1014] RET 1 empty(&queue) [L1014] COND FALSE 1 !(empty(&queue)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, empty(&queue)=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1018] 1 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] 2 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1037] COND TRUE 2 i<(20) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=9] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L980] 1 q->element[q->tail] = x VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] EXPR 1 q->amount VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, queue={6:0}, stored_elements={7:0}, x=0] [L981] 1 q->amount++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->amount=1, q->amount++=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L988] EXPR 1 q->tail VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, queue={6:0}, stored_elements={7:0}, x=0] [L988] 1 q->tail++ VAL [\old(x)=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, q->tail=1, q->tail++=1, queue={6:0}, stored_elements={7:0}, x=0] [L990] 1 return 0; VAL [\old(x)=0, \result=0, dequeue_flag=0, enqueue_flag=1, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1026] 1 enqueue_flag=(0) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1027] 1 dequeue_flag=(1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1040] COND TRUE 2 \read(dequeue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1018] 1 i++ VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] EXPR 2 q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=9, q->head=0, queue={6:0}, stored_elements={7:0}] [L995] 2 x = q->element[q->head] VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->element[q->head]=9, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L996] EXPR 2 q->amount VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, queue={6:0}, stored_elements={7:0}, x=9] [L996] 2 q->amount-- VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->amount=2, q->amount--=2, queue={6:0}, stored_elements={7:0}, x=9] [L997] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L997] COND FALSE 2 !(q->head == (20)) VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L1002] EXPR 2 q->head VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, queue={6:0}, stored_elements={7:0}, x=9] [L1002] 2 q->head++ VAL [dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, q->head=0, q->head++=0, queue={6:0}, stored_elements={7:0}, x=9] [L1003] 2 return x; VAL [\result=9, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=9] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=9, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=0] [L1043] 2 reach_error() VAL [arg={6:0}, arg={6:0}, dequeue_flag=1, enqueue_flag=0, i=2, m={5:0}, queue={6:0}, stored_elements={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 6.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1661 NumberOfCodeBlocks, 1661 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1832 ConstructedInterpolants, 0 QuantifiedInterpolants, 7761 SizeOfPredicates, 2 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 1/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 65 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 437 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 781 NumberOfCodeBlocks, 781 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 545 ConstructedInterpolants, 0 QuantifiedInterpolants, 1084 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-05-04 07:35:35,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2023-05-04 07:35:36,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2023-05-04 07:35:36,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 07:35:36,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...