/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 10:35:09,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 10:35:09,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 10:35:09,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 10:35:09,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 10:35:09,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 10:35:09,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 10:35:09,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 10:35:09,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 10:35:09,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 10:35:09,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 10:35:09,607 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 10:35:09,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 10:35:09,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 10:35:09,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 10:35:09,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 10:35:09,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 10:35:09,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 10:35:09,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 10:35:09,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 10:35:09,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 10:35:09,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 10:35:09,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 10:35:09,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 10:35:09,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 10:35:09,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 10:35:09,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 10:35:09,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 10:35:09,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 10:35:09,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 10:35:09,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 10:35:09,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 10:35:09,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 10:35:09,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 10:35:09,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 10:35:09,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 10:35:09,633 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 10:35:09,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 10:35:09,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 10:35:09,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 10:35:09,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 10:35:09,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 10:35:09,668 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 10:35:09,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 10:35:09,668 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 10:35:09,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 10:35:09,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 10:35:09,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 10:35:09,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 10:35:09,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 10:35:09,670 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 10:35:09,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 10:35:09,671 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 10:35:09,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 10:35:09,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 10:35:09,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 10:35:09,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 10:35:09,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 10:35:09,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 10:35:09,672 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 10:35:09,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 10:35:09,672 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 10:35:09,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 10:35:09,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 10:35:09,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 10:35:09,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 10:35:09,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 10:35:09,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 10:35:09,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 10:35:09,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 10:35:09,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 10:35:09,674 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 10:35:09,674 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 10:35:09,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 10:35:09,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 10:35:09,675 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 10:35:09,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 10:35:09,675 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 10:35:09,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-04 10:35:09,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 10:35:09,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 10:35:09,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 10:35:09,917 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 10:35:09,919 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 10:35:09,920 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 10:35:09,976 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e99d3fd/b42274f2ebd84ddf9e3e7449783cb4ae/FLAGec32726be [2023-05-04 10:35:10,471 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 10:35:10,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2023-05-04 10:35:10,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e99d3fd/b42274f2ebd84ddf9e3e7449783cb4ae/FLAGec32726be [2023-05-04 10:35:10,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38e99d3fd/b42274f2ebd84ddf9e3e7449783cb4ae [2023-05-04 10:35:11,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 10:35:11,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 10:35:11,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 10:35:11,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 10:35:11,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 10:35:11,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@991b2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11, skipping insertion in model container [2023-05-04 10:35:11,011 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 10:35:11,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 10:35:11,430 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 10:35:11,435 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 10:35:11,445 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 10:35:11,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 10:35:11,463 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 10:35:11,527 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 10:35:11,529 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 10:35:11,531 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 10:35:11,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 10:35:11,604 INFO L208 MainTranslator]: Completed translation [2023-05-04 10:35:11,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11 WrapperNode [2023-05-04 10:35:11,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 10:35:11,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 10:35:11,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 10:35:11,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 10:35:11,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,684 INFO L138 Inliner]: procedures = 274, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2023-05-04 10:35:11,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 10:35:11,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 10:35:11,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 10:35:11,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 10:35:11,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,734 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,736 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 10:35:11,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 10:35:11,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 10:35:11,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 10:35:11,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (1/1) ... [2023-05-04 10:35:11,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 10:35:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:35:11,778 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 10:35:11,792 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 10:35:11,822 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 10:35:11,823 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 10:35:11,823 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 10:35:11,823 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 10:35:11,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 10:35:11,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 10:35:11,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 10:35:11,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 10:35:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 10:35:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 10:35:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 10:35:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 10:35:11,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 10:35:11,825 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 10:35:12,017 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 10:35:12,019 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 10:35:12,439 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 10:35:12,454 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 10:35:12,455 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 10:35:12,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 10:35:12 BoogieIcfgContainer [2023-05-04 10:35:12,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 10:35:12,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 10:35:12,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 10:35:12,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 10:35:12,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 10:35:11" (1/3) ... [2023-05-04 10:35:12,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d894832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 10:35:12, skipping insertion in model container [2023-05-04 10:35:12,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:35:11" (2/3) ... [2023-05-04 10:35:12,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d894832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 10:35:12, skipping insertion in model container [2023-05-04 10:35:12,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 10:35:12" (3/3) ... [2023-05-04 10:35:12,463 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2023-05-04 10:35:12,470 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 10:35:12,478 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 10:35:12,478 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 10:35:12,478 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 10:35:12,606 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 10:35:12,649 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:35:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 10:35:12,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:35:12,653 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 10:35:12,654 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 10:35:12,683 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 10:35:12,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 10:35:12,706 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;@294bca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:35:12,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 10:35:12,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:12,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash -570934411, now seen corresponding path program 1 times [2023-05-04 10:35:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:12,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137692734] [2023-05-04 10:35:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:13,431 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 10:35:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137692734] [2023-05-04 10:35:13,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137692734] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:13,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:13,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 10:35:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069911640] [2023-05-04 10:35:13,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:13,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 10:35:13,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 10:35:13,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 10:35:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:13,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:13,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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 10:35:13,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:13,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 10:35:13,547 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:13,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:13,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1410556184, now seen corresponding path program 1 times [2023-05-04 10:35:13,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:13,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484510423] [2023-05-04 10:35:13,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:13,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:14,543 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 10:35:14,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:14,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484510423] [2023-05-04 10:35:14,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484510423] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:14,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:14,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 10:35:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142235977] [2023-05-04 10:35:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:14,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 10:35:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 10:35:14,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 10:35:14,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:14,551 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:14,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.083333333333334) internal successors, (121), 12 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 10:35:14,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:14,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:14,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 10:35:14,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:14,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1496802387, now seen corresponding path program 1 times [2023-05-04 10:35:14,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:14,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430645370] [2023-05-04 10:35:14,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:16,163 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 10:35:16,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:16,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430645370] [2023-05-04 10:35:16,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430645370] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:16,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:16,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-05-04 10:35:16,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196597078] [2023-05-04 10:35:16,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:16,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-05-04 10:35:16,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:16,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-05-04 10:35:16,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-05-04 10:35:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:16,167 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:16,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 10:35:16,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:16,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:16,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:16,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:16,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 10:35:16,882 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:16,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1206457166, now seen corresponding path program 1 times [2023-05-04 10:35:16,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:16,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751761878] [2023-05-04 10:35:16,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:16,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:19,717 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 10:35:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:19,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751761878] [2023-05-04 10:35:19,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751761878] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:19,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:19,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-05-04 10:35:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438000670] [2023-05-04 10:35:19,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:19,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-05-04 10:35:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:19,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-05-04 10:35:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2023-05-04 10:35:19,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:19,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:19,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.04) internal successors, (126), 25 states have internal predecessors, (126), 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 10:35:19,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:19,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:19,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:19,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-05-04 10:35:21,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 10:35:21,346 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash -967720526, now seen corresponding path program 1 times [2023-05-04 10:35:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:21,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597506362] [2023-05-04 10:35:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:21,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:21,435 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 10:35:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:21,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597506362] [2023-05-04 10:35:21,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597506362] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:21,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:21,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 10:35:21,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397749972] [2023-05-04 10:35:21,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:21,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 10:35:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:21,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 10:35:21,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 10:35:21,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:21,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 10:35:21,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:21,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:21,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:21,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2023-05-04 10:35:21,440 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 10:35:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:21,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 10:35:21,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash 674282551, now seen corresponding path program 1 times [2023-05-04 10:35:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:21,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809555046] [2023-05-04 10:35:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:21,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:23,846 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 10:35:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:23,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809555046] [2023-05-04 10:35:23,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809555046] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:23,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:23,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2023-05-04 10:35:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715747839] [2023-05-04 10:35:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:23,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-05-04 10:35:23,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:23,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-05-04 10:35:23,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2023-05-04 10:35:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:23,849 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:23,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.517241379310345) internal successors, (131), 29 states have internal predecessors, (131), 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 10:35:23,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:23,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:23,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:23,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 10:35:23,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:23,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 10:35:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 10:35:26,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 10:35:26,167 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:26,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1466864423, now seen corresponding path program 1 times [2023-05-04 10:35:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429401661] [2023-05-04 10:35:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:26,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:26,322 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 10:35:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:26,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429401661] [2023-05-04 10:35:26,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429401661] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:26,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:26,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 10:35:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266674254] [2023-05-04 10:35:26,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 10:35:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 10:35:26,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 10:35:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:26,324 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:26,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 10:35:26,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:26,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:26,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 10:35:26,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 10:35:26,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 10:35:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 10:35:26,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:26,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 10:35:26,813 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:26,814 INFO L85 PathProgramCache]: Analyzing trace with hash -873923350, now seen corresponding path program 1 times [2023-05-04 10:35:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:26,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019385748] [2023-05-04 10:35:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:26,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:26,921 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 10:35:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:26,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019385748] [2023-05-04 10:35:26,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019385748] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:26,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:26,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 10:35:26,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252913496] [2023-05-04 10:35:26,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:26,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 10:35:26,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:26,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 10:35:26,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 10:35:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:26,924 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:26,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 10:35:26,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:26,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:26,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-05-04 10:35:26,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:26,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-05-04 10:35:26,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:26,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-05-04 10:35:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-05-04 10:35:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:27,246 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 10:35:27,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 10:35:27,258 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 10:35:27,259 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 10:35:27,268 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:35:27,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 10:35:27,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:35:27,273 INFO L229 MonitoredProcess]: Starting monitored process 3 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 10:35:27,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 10:35:27,282 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 10:35:27,284 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 10:35:27,284 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;@294bca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:35:27,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 10:35:27,543 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 10:35:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash 935827827, now seen corresponding path program 1 times [2023-05-04 10:35:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:27,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486060414] [2023-05-04 10:35:27,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:27,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:27,563 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 10:35:27,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:27,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486060414] [2023-05-04 10:35:27,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486060414] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:27,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:27,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 10:35:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368473803] [2023-05-04 10:35:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:27,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 10:35:27,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:27,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 10:35:27,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 10:35:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:27,566 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:27,566 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 10:35:27,566 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:27,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 10:35:27,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 10:35:27,587 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 10:35:27,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 10:35:27,590 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 10:35:27,591 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 10:35:27,594 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:35:27,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 10:35:27,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:35:27,642 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 10:35:27,645 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 10:35:27,647 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 10:35:27,647 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;@294bca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:35:27,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 10:35:27,669 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 10:35:27,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1920135184, now seen corresponding path program 1 times [2023-05-04 10:35:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:27,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407017820] [2023-05-04 10:35:27,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:27,793 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 10:35:27,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:27,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407017820] [2023-05-04 10:35:27,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407017820] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:27,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:27,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 10:35:27,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108675755] [2023-05-04 10:35:27,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:27,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 10:35:27,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:27,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 10:35:27,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 10:35:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:27,796 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:27,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 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 10:35:27,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:27,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 10:35:27,833 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:27,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:27,833 INFO L85 PathProgramCache]: Analyzing trace with hash -189107293, now seen corresponding path program 1 times [2023-05-04 10:35:27,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:27,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528784749] [2023-05-04 10:35:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:27,947 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 10:35:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:27,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528784749] [2023-05-04 10:35:27,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528784749] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:27,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:27,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 10:35:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860834003] [2023-05-04 10:35:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:27,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 10:35:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 10:35:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 10:35:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:27,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:27,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 10:35:27,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:27,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 10:35:28,007 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash -954369840, now seen corresponding path program 1 times [2023-05-04 10:35:28,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:28,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410940712] [2023-05-04 10:35:28,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:28,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:28,068 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 10:35:28,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:28,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410940712] [2023-05-04 10:35:28,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410940712] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:28,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:28,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 10:35:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641533240] [2023-05-04 10:35:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 10:35:28,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 10:35:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 10:35:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:28,071 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:28,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 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 10:35:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 10:35:28,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1424271072, now seen corresponding path program 1 times [2023-05-04 10:35:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:28,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057132894] [2023-05-04 10:35:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:28,227 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 10:35:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:28,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057132894] [2023-05-04 10:35:28,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057132894] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:28,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:28,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 10:35:28,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369480696] [2023-05-04 10:35:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:28,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 10:35:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 10:35:28,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 10:35:28,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:28,229 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:28,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 10:35:28,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,229 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 10:35:28,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1228210326, now seen corresponding path program 1 times [2023-05-04 10:35:28,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:28,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687892090] [2023-05-04 10:35:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:28,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 10:35:28,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:28,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687892090] [2023-05-04 10:35:28,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687892090] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:28,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:28,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 10:35:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714752927] [2023-05-04 10:35:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 10:35:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 10:35:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 10:35:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:28,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:28,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 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 10:35:28,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:28,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 10:35:28,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:28,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1881905051, now seen corresponding path program 1 times [2023-05-04 10:35:28,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:28,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554668004] [2023-05-04 10:35:28,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:28,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 10:35:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:29,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554668004] [2023-05-04 10:35:29,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554668004] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:29,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:29,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 10:35:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306475812] [2023-05-04 10:35:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:29,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 10:35:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 10:35:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 10:35:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:29,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:29,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.666666666666668) internal successors, (212), 12 states have internal predecessors, (212), 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 10:35:29,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:29,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:29,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:29,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:29,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:29,009 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:29,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:29,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-04 10:35:29,401 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -194164592, now seen corresponding path program 1 times [2023-05-04 10:35:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:29,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832914847] [2023-05-04 10:35:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 10:35:30,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:30,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832914847] [2023-05-04 10:35:30,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832914847] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:35:30,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:35:30,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-05-04 10:35:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353162833] [2023-05-04 10:35:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:35:30,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-04 10:35:30,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:35:30,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-04 10:35:30,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-05-04 10:35:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:30,455 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:35:30,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.529411764705882) internal successors, (213), 17 states have internal predecessors, (213), 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 10:35:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:30,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:35:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:35:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:35:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:35:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:35:31,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-05-04 10:35:31,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:35:31,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:35:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash 199980619, now seen corresponding path program 1 times [2023-05-04 10:35:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:35:31,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681760542] [2023-05-04 10:35:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:31,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:35:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 10:35:35,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:35:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681760542] [2023-05-04 10:35:35,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681760542] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 10:35:35,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980420894] [2023-05-04 10:35:35,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:35:35,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 10:35:35,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:35:35,857 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 10:35:35,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 10:35:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:35:36,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 127 conjunts are in the unsatisfiable core [2023-05-04 10:35:36,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 10:35:36,242 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 10:35:36,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 10:35:36,298 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 10:35:36,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 10:35:36,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 10:35:36,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 10:35:37,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-05-04 10:35:37,642 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 10:35:37,658 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 10:35:37,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2023-05-04 10:35:37,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:35:37,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:35:37,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-05-04 10:35:37,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-05-04 10:35:38,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:35:38,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 10:35:38,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-04 10:35:39,295 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-05-04 10:35:39,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 34 [2023-05-04 10:35:39,561 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 10:35:39,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:35:39,574 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-05-04 10:35:39,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56 [2023-05-04 10:35:39,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-05-04 10:35:40,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:35:40,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-05-04 10:35:40,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:35:40,734 INFO L356 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2023-05-04 10:35:40,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58 [2023-05-04 10:35:41,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:35:41,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-05-04 10:35:41,035 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 10:35:41,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2023-05-04 10:35:41,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-05-04 10:35:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 10:35:41,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 10:35:41,542 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t2Thread1of1ForFork1_dequeue_~x~0#1| 0)) (.cse1 (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset|))) (and (or .cse0 (forall ((v_ArrVal_673 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_673 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2023-05-04 10:35:46,090 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_666 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668)))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |~#stored_elements~0.offset|)) 0))))) is different from false [2023-05-04 10:35:46,279 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_666 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668)))) (store .cse1 |c_~#stored_elements~0.base| (store (select .cse1 |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset| (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) (+ (* |c_t2Thread1of1ForFork1_#t~post57#1| 4) 4 |~#stored_elements~0.offset|)) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20))))) is different from false [2023-05-04 10:35:53,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_666 Int)) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse3 |c_~#queue~0.base| (store (store (store (select .cse3 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)))))) is different from false [2023-05-04 10:35:54,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_666 Int)) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse3 |c_~#queue~0.base| (store (store (store (select .cse3 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)))))) is different from false [2023-05-04 10:35:54,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_666 Int)) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse3 |c_~#queue~0.base| (store (store (store (select .cse3 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)))))) is different from false [2023-05-04 10:35:54,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_658 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_666 Int)) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_658) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse3 |c_~#queue~0.base| (store (store (store (select .cse3 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)))))) is different from false [2023-05-04 10:35:54,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_658 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_656 Int) (v_ArrVal_666 Int)) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_656) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_658) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse3 |c_~#queue~0.base| (store (store (store (select .cse3 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 0 (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1))) (not (= 20 (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))))))) is different from false [2023-05-04 10:35:54,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_658 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_656 Int) (v_ArrVal_666 Int)) (let ((.cse3 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_656) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_658) .cse1 v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse5 |c_~#queue~0.base| (store (store (store (select .cse5 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 20 (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse3) 0))))))))) is different from false [2023-05-04 10:35:54,828 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_658 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_656 Int) (v_ArrVal_666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse3 (+ 4 |~#stored_elements~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_656) (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_658) .cse1 v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse5 |c_~#queue~0.base| (store (store (store (select .cse5 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) (+ 88 |c_~#queue~0.offset|) v_ArrVal_666) (+ 84 |c_~#queue~0.offset|) v_ArrVal_668))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse0 .cse1))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse3) 0)) (not (= 20 (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)))))))) is different from false [2023-05-04 10:35:55,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_658 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_656 Int) (v_ArrVal_666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse3 (+ 4 |~#stored_elements~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_656) .cse6 v_ArrVal_658) .cse1 v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse5 |c_~#queue~0.base| (store (store (store (select .cse5 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse6 v_ArrVal_666) .cse1 v_ArrVal_668)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse0 .cse1))) (not (= (select (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse3) 0)))))) is different from false [2023-05-04 10:35:55,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_658 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_656 Int) (v_ArrVal_666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_654))) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (let ((.cse4 (let ((.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse5 (store (store (store .cse7 |c_~#queue~0.base| (store (store (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_656) .cse6 v_ArrVal_658) .cse3 v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse5 |c_~#queue~0.base| (store (store (store (select .cse5 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse6 v_ArrVal_666) .cse3 v_ArrVal_668)))))) (store .cse4 |c_~#stored_elements~0.base| (store (select .cse4 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 80)) 20)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse1) 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse2 .cse3)))))))) is different from false [2023-05-04 10:35:57,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_659 Int) (v_ArrVal_658 Int) (v_ArrVal_662 (Array Int Int)) (v_ArrVal_668 Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_654 (Array Int Int)) (v_ArrVal_656 Int) (v_ArrVal_666 Int) (v_ArrVal_652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_652)))) (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_654))) (let ((.cse6 (+ 4 |~#stored_elements~0.offset|)) (.cse5 (select .cse10 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 80)) (.cse4 (let ((.cse7 (let ((.cse9 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store (store .cse10 |c_~#queue~0.base| (store (store (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24|) |c_~#queue~0.offset|) v_ArrVal_656) .cse9 v_ArrVal_658) .cse1 v_ArrVal_659)) |c_~#stored_elements~0.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_662))) (store .cse8 |c_~#queue~0.base| (store (store (store (select .cse8 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_666) .cse1 v_ArrVal_668)))))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (not (= (select (select .cse4 |c_~#queue~0.base|) .cse2) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_24| (select .cse5 .cse1))) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_673) |c_~#stored_elements~0.base|) .cse6) 0)))))))) is different from false [2023-05-04 10:35:57,219 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-04 10:35:57,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1434 treesize of output 1167 [2023-05-04 10:35:57,372 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 10:35:57,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9959 treesize of output 9903 [2023-05-04 10:35:57,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9629 treesize of output 9433 [2023-05-04 10:35:57,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10370 treesize of output 10130 [2023-05-04 10:35:57,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11738 treesize of output 11354 [2023-05-04 10:35:57,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3062 treesize of output 2678 [2023-05-04 10:35:58,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-05-04 10:35:58,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 10:35:58,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 277 treesize of output 263 [2023-05-04 10:36:00,085 INFO L356 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2023-05-04 10:36:00,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 80 [2023-05-04 10:36:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 10:36:00,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980420894] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 10:36:00,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 10:36:00,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 46, 47] total 124 [2023-05-04 10:36:00,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545722444] [2023-05-04 10:36:00,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 10:36:00,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2023-05-04 10:36:00,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:36:00,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2023-05-04 10:36:00,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=11332, Unknown=63, NotChecked=2990, Total=15252 [2023-05-04 10:36:00,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:36:00,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:36:00,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 4.830645161290323) internal successors, (599), 124 states have internal predecessors, (599), 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 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:36:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 10:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 10:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 10:36:14,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-05-04 10:36:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-05-04 10:36:14,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 10:36:14,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-05-04 10:36:14,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 10:36:14,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:36:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1201166086, now seen corresponding path program 1 times [2023-05-04 10:36:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:36:14,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032909563] [2023-05-04 10:36:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:36:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:36:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 10:36:15,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 10:36:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 10:36:15,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 10:36:15,239 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 10:36:15,240 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 10:36:15,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-05-04 10:36:15,241 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 10:36:15,243 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2023-05-04 10:36:15,246 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 10:36:15,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 10:36:15,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 10:36:15 BasicIcfg [2023-05-04 10:36:15,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 10:36:15,401 INFO L158 Benchmark]: Toolchain (without parser) took 64399.48ms. Allocated memory was 182.5MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 123.3MB in the beginning and 814.7MB in the end (delta: -691.4MB). Peak memory consumption was 160.6MB. Max. memory is 8.0GB. [2023-05-04 10:36:15,401 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 10:36:15,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.87ms. Allocated memory is still 182.5MB. Free memory was 123.1MB in the beginning and 134.8MB in the end (delta: -11.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-05-04 10:36:15,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.22ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 131.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 10:36:15,405 INFO L158 Benchmark]: Boogie Preprocessor took 55.49ms. Allocated memory is still 182.5MB. Free memory was 131.5MB in the beginning and 129.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 10:36:15,405 INFO L158 Benchmark]: RCFGBuilder took 714.66ms. Allocated memory is still 182.5MB. Free memory was 129.2MB in the beginning and 106.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-05-04 10:36:15,405 INFO L158 Benchmark]: TraceAbstraction took 62942.69ms. Allocated memory was 182.5MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 105.0MB in the beginning and 814.7MB in the end (delta: -709.7MB). Peak memory consumption was 142.4MB. Max. memory is 8.0GB. [2023-05-04 10:36:15,407 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.14ms. Allocated memory is still 182.5MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 599.87ms. Allocated memory is still 182.5MB. Free memory was 123.1MB in the beginning and 134.8MB in the end (delta: -11.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.22ms. Allocated memory is still 182.5MB. Free memory was 134.7MB in the beginning and 131.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.49ms. Allocated memory is still 182.5MB. Free memory was 131.5MB in the beginning and 129.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 714.66ms. Allocated memory is still 182.5MB. Free memory was 129.2MB in the beginning and 106.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 62942.69ms. Allocated memory was 182.5MB in the beginning and 1.0GB in the end (delta: 851.4MB). Free memory was 105.0MB in the beginning and 814.7MB in the end (delta: -709.7MB). Peak memory consumption was 142.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23824, independent: 21543, independent conditional: 7298, independent unconditional: 14245, dependent: 2281, dependent conditional: 2210, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21650, independent: 21543, independent conditional: 7298, independent unconditional: 14245, dependent: 107, dependent conditional: 36, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21650, independent: 21543, independent conditional: 7298, independent unconditional: 14245, dependent: 107, dependent conditional: 36, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22101, independent: 21543, independent conditional: 87, independent unconditional: 21456, dependent: 558, dependent conditional: 364, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22101, independent: 21543, independent conditional: 87, independent unconditional: 21456, dependent: 558, dependent conditional: 79, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22101, independent: 21543, independent conditional: 87, independent unconditional: 21456, dependent: 558, dependent conditional: 79, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11952, independent: 11870, independent conditional: 16, independent unconditional: 11854, dependent: 82, dependent conditional: 11, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11952, independent: 11850, independent conditional: 0, independent unconditional: 11850, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 102, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 82, dependent conditional: 11, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 102, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 82, dependent conditional: 11, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, independent: 82, independent conditional: 40, independent unconditional: 41, dependent: 181, dependent conditional: 32, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22101, independent: 9673, independent conditional: 71, independent unconditional: 9602, dependent: 476, dependent conditional: 68, dependent unconditional: 408, unknown: 11952, unknown conditional: 27, unknown unconditional: 11925] , Statistics on independence cache: Total cache size (in pairs): 11952, Positive cache size: 11870, Positive conditional cache size: 16, Positive unconditional cache size: 11854, Negative cache size: 82, Negative conditional cache size: 11, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 285, Maximal queried relation: 7, Independence queries for same thread: 2174 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 2316, Number of trivial persistent sets: 1861, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14316, independent: 14245, independent conditional: 0, independent unconditional: 14245, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23824, independent: 21543, independent conditional: 7298, independent unconditional: 14245, dependent: 2281, dependent conditional: 2210, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21650, independent: 21543, independent conditional: 7298, independent unconditional: 14245, dependent: 107, dependent conditional: 36, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21650, independent: 21543, independent conditional: 7298, independent unconditional: 14245, dependent: 107, dependent conditional: 36, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22101, independent: 21543, independent conditional: 87, independent unconditional: 21456, dependent: 558, dependent conditional: 364, dependent unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22101, independent: 21543, independent conditional: 87, independent unconditional: 21456, dependent: 558, dependent conditional: 79, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22101, independent: 21543, independent conditional: 87, independent unconditional: 21456, dependent: 558, dependent conditional: 79, dependent unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11952, independent: 11870, independent conditional: 16, independent unconditional: 11854, dependent: 82, dependent conditional: 11, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11952, independent: 11850, independent conditional: 0, independent unconditional: 11850, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 102, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 82, dependent conditional: 11, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 102, independent: 20, independent conditional: 16, independent unconditional: 4, dependent: 82, dependent conditional: 11, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, independent: 82, independent conditional: 40, independent unconditional: 41, dependent: 181, dependent conditional: 32, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 22101, independent: 9673, independent conditional: 71, independent unconditional: 9602, dependent: 476, dependent conditional: 68, dependent unconditional: 408, unknown: 11952, unknown conditional: 27, unknown unconditional: 11925] , Statistics on independence cache: Total cache size (in pairs): 11952, Positive cache size: 11870, Positive conditional cache size: 16, Positive unconditional cache size: 11854, Negative cache size: 82, Negative conditional cache size: 11, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 285, Maximal queried relation: 7, Independence queries for same thread: 2174 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9956, independent: 9549, independent conditional: 796, independent unconditional: 8753, dependent: 407, dependent conditional: 332, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9664, independent: 9549, independent conditional: 796, independent unconditional: 8753, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9664, independent: 9549, independent conditional: 796, independent unconditional: 8753, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9684, independent: 9549, independent conditional: 0, independent unconditional: 9549, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9684, independent: 9549, independent conditional: 0, independent unconditional: 9549, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9684, independent: 9549, independent conditional: 0, independent unconditional: 9549, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8690, independent: 8615, independent conditional: 0, independent unconditional: 8615, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8690, independent: 8611, independent conditional: 0, independent unconditional: 8611, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9684, independent: 934, independent conditional: 0, independent unconditional: 934, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8690, unknown conditional: 0, unknown unconditional: 8690] , Statistics on independence cache: Total cache size (in pairs): 8690, Positive cache size: 8615, Positive conditional cache size: 0, Positive unconditional cache size: 8615, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, 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: 292 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 543, Number of trivial persistent sets: 528, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8828, independent: 8753, independent conditional: 0, independent unconditional: 8753, 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: 9956, independent: 9549, independent conditional: 796, independent unconditional: 8753, dependent: 407, dependent conditional: 332, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9664, independent: 9549, independent conditional: 796, independent unconditional: 8753, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9664, independent: 9549, independent conditional: 796, independent unconditional: 8753, dependent: 115, dependent conditional: 40, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9684, independent: 9549, independent conditional: 0, independent unconditional: 9549, dependent: 135, dependent conditional: 20, dependent unconditional: 115, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9684, independent: 9549, independent conditional: 0, independent unconditional: 9549, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9684, independent: 9549, independent conditional: 0, independent unconditional: 9549, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8690, independent: 8615, independent conditional: 0, independent unconditional: 8615, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8690, independent: 8611, independent conditional: 0, independent unconditional: 8611, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 138, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9684, independent: 934, independent conditional: 0, independent unconditional: 934, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 8690, unknown conditional: 0, unknown unconditional: 8690] , Statistics on independence cache: Total cache size (in pairs): 8690, Positive cache size: 8615, Positive conditional cache size: 0, Positive unconditional cache size: 8615, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, 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: 292 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 22387, independent: 20021, independent conditional: 6491, independent unconditional: 13530, dependent: 2366, dependent conditional: 2302, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20105, independent: 20021, independent conditional: 6491, independent unconditional: 13530, dependent: 84, dependent conditional: 20, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20105, independent: 20021, independent conditional: 6491, independent unconditional: 13530, dependent: 84, dependent conditional: 20, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20296, independent: 20021, independent conditional: 20, independent unconditional: 20001, dependent: 275, dependent conditional: 171, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20296, independent: 20021, independent conditional: 20, independent unconditional: 20001, dependent: 275, dependent conditional: 20, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20296, independent: 20021, independent conditional: 20, independent unconditional: 20001, dependent: 275, dependent conditional: 20, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11699, independent: 11633, independent conditional: 2, independent unconditional: 11631, dependent: 66, dependent conditional: 2, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11699, independent: 11625, independent conditional: 0, independent unconditional: 11625, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 66, dependent conditional: 2, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 66, dependent conditional: 2, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 33, independent conditional: 3, independent unconditional: 31, dependent: 89, dependent conditional: 6, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 20296, independent: 8388, independent conditional: 18, independent unconditional: 8370, dependent: 209, dependent conditional: 18, dependent unconditional: 191, unknown: 11699, unknown conditional: 4, unknown unconditional: 11695] , Statistics on independence cache: Total cache size (in pairs): 11699, Positive cache size: 11633, Positive conditional cache size: 2, Positive unconditional cache size: 11631, Negative cache size: 66, Negative conditional cache size: 2, Negative unconditional cache size: 64, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 151, Maximal queried relation: 7, Independence queries for same thread: 2282 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 680, Number of trivial persistent sets: 453, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13594, independent: 13530, independent conditional: 0, independent unconditional: 13530, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 22387, independent: 20021, independent conditional: 6491, independent unconditional: 13530, dependent: 2366, dependent conditional: 2302, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20105, independent: 20021, independent conditional: 6491, independent unconditional: 13530, dependent: 84, dependent conditional: 20, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20105, independent: 20021, independent conditional: 6491, independent unconditional: 13530, dependent: 84, dependent conditional: 20, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20296, independent: 20021, independent conditional: 20, independent unconditional: 20001, dependent: 275, dependent conditional: 171, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20296, independent: 20021, independent conditional: 20, independent unconditional: 20001, dependent: 275, dependent conditional: 20, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20296, independent: 20021, independent conditional: 20, independent unconditional: 20001, dependent: 275, dependent conditional: 20, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11699, independent: 11633, independent conditional: 2, independent unconditional: 11631, dependent: 66, dependent conditional: 2, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11699, independent: 11625, independent conditional: 0, independent unconditional: 11625, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 74, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 66, dependent conditional: 2, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 66, dependent conditional: 2, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 122, independent: 33, independent conditional: 3, independent unconditional: 31, dependent: 89, dependent conditional: 6, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 20296, independent: 8388, independent conditional: 18, independent unconditional: 8370, dependent: 209, dependent conditional: 18, dependent unconditional: 191, unknown: 11699, unknown conditional: 4, unknown unconditional: 11695] , Statistics on independence cache: Total cache size (in pairs): 11699, Positive cache size: 11633, Positive conditional cache size: 2, Positive unconditional cache size: 11631, Negative cache size: 66, Negative conditional cache size: 2, Negative unconditional cache size: 64, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 151, Maximal queried relation: 7, Independence queries for same thread: 2282 - 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)=17, 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()=18, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=18] [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=18, 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=18] [L980] 1 q->element[q->tail] = x VAL [\old(x)=18, 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=18] [L981] EXPR 1 q->amount VAL [\old(x)=18, 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=18] [L981] 1 q->amount++ VAL [\old(x)=18, 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=18] [L982] EXPR 1 q->tail VAL [\old(x)=18, 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=18] [L982] COND FALSE 1 !(q->tail == (20)) VAL [\old(x)=18, 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=18] [L988] EXPR 1 q->tail VAL [\old(x)=18, 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=18] [L988] 1 q->tail++ VAL [\old(x)=18, 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=18] [L990] 1 return 0; VAL [\old(x)=18, \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=18] [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=18] [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=18] [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=0, \result=-1, 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=18] [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=18] [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)=18, queue={6:0}, stored_elements={7:0}] [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}] [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}] [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}] [L1065] 0 \read(id1) VAL [\read(id1)=17, dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [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=18] [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=18] [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] [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] [L1037] COND TRUE 2 i<(20) 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}] [L1040] COND TRUE 2 \read(dequeue_flag) 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}] [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]=18, 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]=18, q->head=0, queue={6:0}, stored_elements={7:0}, x=18] [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=18] [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=18] [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=18] [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=18] [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=18] [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=18] [L1003] 2 return x; VAL [\result=18, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=18] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=18, dequeue_flag=1, enqueue_flag=0, i=1, 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)=18, dequeue_flag=1, enqueue_flag=0, i=1, 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=1, 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: 14.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 6.3s, 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: 97, 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.2s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 1075 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1067 ConstructedInterpolants, 0 QuantifiedInterpolants, 7009 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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: 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.3s, 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: 47.6s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 16.0s, 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: 101, 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.2s SatisfiabilityAnalysisTime, 30.7s InterpolantComputationTime, 1966 NumberOfCodeBlocks, 1966 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1952 ConstructedInterpolants, 179 QuantifiedInterpolants, 47039 SizeOfPredicates, 52 NumberOfNonLiveVariables, 509 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 42/54 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 10:36:15,441 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 10:36:15,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2023-05-04 10:36:15,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-04 10:36:16,066 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...