/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_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 06:45:32,813 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 06:45:32,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 06:45:32,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 06:45:32,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 06:45:32,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 06:45:32,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 06:45:32,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 06:45:32,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 06:45:32,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 06:45:32,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 06:45:32,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 06:45:32,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 06:45:32,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 06:45:32,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 06:45:32,863 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 06:45:32,864 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 06:45:32,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 06:45:32,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 06:45:32,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 06:45:32,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 06:45:32,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 06:45:32,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 06:45:32,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 06:45:32,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 06:45:32,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 06:45:32,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 06:45:32,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 06:45:32,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 06:45:32,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 06:45:32,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 06:45:32,878 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 06:45:32,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 06:45:32,879 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 06:45:32,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 06:45:32,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 06:45:32,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 06:45:32,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 06:45:32,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 06:45:32,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 06:45:32,882 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 06:45:32,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 06:45:32,922 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 06:45:32,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 06:45:32,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 06:45:32,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 06:45:32,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 06:45:32,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 06:45:32,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 06:45:32,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 06:45:32,924 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 06:45:32,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 06:45:32,925 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 06:45:32,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 06:45:32,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 06:45:32,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 06:45:32,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 06:45:32,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 06:45:32,925 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 06:45:32,926 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 06:45:32,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 06:45:32,926 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 06:45:32,926 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 06:45:32,926 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 06:45:32,926 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 06:45:32,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 06:45:32,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 06:45:32,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 06:45:32,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 06:45:32,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 06:45:32,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 06:45:32,928 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 06:45:32,928 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 06:45:32,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 06:45:32,928 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 06:45:32,928 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 06:45:32,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 06:45:32,929 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 06:45:32,929 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-20 06:45:33,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 06:45:33,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 06:45:33,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 06:45:33,167 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 06:45:33,170 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 06:45:33,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2023-05-20 06:45:33,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78125b5c8/84ea68ba33424661809d42db6ab78fd2/FLAG772473b50 [2023-05-20 06:45:33,673 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 06:45:33,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2023-05-20 06:45:33,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78125b5c8/84ea68ba33424661809d42db6ab78fd2/FLAG772473b50 [2023-05-20 06:45:33,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78125b5c8/84ea68ba33424661809d42db6ab78fd2 [2023-05-20 06:45:33,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 06:45:33,994 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 06:45:33,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 06:45:33,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 06:45:33,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 06:45:33,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 06:45:33" (1/1) ... [2023-05-20 06:45:34,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77e4f749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:33, skipping insertion in model container [2023-05-20 06:45:34,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 06:45:33" (1/1) ... [2023-05-20 06:45:34,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 06:45:34,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 06:45:34,397 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_longer.i[43296,43309] [2023-05-20 06:45:34,402 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_longer.i[43503,43516] [2023-05-20 06:45:34,404 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_longer.i[43783,43796] [2023-05-20 06:45:34,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 06:45:34,416 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 06:45:34,454 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_longer.i[43296,43309] [2023-05-20 06:45:34,455 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_longer.i[43503,43516] [2023-05-20 06:45:34,458 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_longer.i[43783,43796] [2023-05-20 06:45:34,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 06:45:34,515 INFO L208 MainTranslator]: Completed translation [2023-05-20 06:45:34,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34 WrapperNode [2023-05-20 06:45:34,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 06:45:34,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 06:45:34,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 06:45:34,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 06:45:34,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,593 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-05-20 06:45:34,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 06:45:34,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 06:45:34,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 06:45:34,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 06:45:34,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,643 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 06:45:34,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 06:45:34,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 06:45:34,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 06:45:34,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (1/1) ... [2023-05-20 06:45:34,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 06:45:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 06:45:34,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-20 06:45:34,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-20 06:45:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-20 06:45:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-20 06:45:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-20 06:45:34,717 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-20 06:45:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 06:45:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 06:45:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 06:45:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 06:45:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-20 06:45:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 06:45:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 06:45:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 06:45:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 06:45:34,719 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 06:45:34,836 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 06:45:34,838 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 06:45:35,226 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 06:45:35,235 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 06:45:35,236 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-20 06:45:35,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 06:45:35 BoogieIcfgContainer [2023-05-20 06:45:35,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 06:45:35,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 06:45:35,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 06:45:35,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 06:45:35,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 06:45:33" (1/3) ... [2023-05-20 06:45:35,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663ef47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 06:45:35, skipping insertion in model container [2023-05-20 06:45:35,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 06:45:34" (2/3) ... [2023-05-20 06:45:35,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663ef47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 06:45:35, skipping insertion in model container [2023-05-20 06:45:35,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 06:45:35" (3/3) ... [2023-05-20 06:45:35,250 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-05-20 06:45:35,257 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 06:45:35,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 06:45:35,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-20 06:45:35,265 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 06:45:35,440 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 06:45:35,490 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 06:45:35,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 06:45:35,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 06:45:35,492 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-20 06:45:35,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-20 06:45:35,524 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 06:45:35,541 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-20 06:45:35,547 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;@87e465c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 06:45:35,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 06:45:35,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:35,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1596867909, now seen corresponding path program 1 times [2023-05-20 06:45:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:35,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806985175] [2023-05-20 06:45:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:35,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:36,920 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-20 06:45:36,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:36,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806985175] [2023-05-20 06:45:36,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806985175] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:36,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:36,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-20 06:45:36,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614437207] [2023-05-20 06:45:36,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:36,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-20 06:45:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:36,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-20 06:45:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-20 06:45:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:36,955 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:36,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:45:36,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:37,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 06:45:37,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash 205824109, now seen corresponding path program 1 times [2023-05-20 06:45:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:37,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317236653] [2023-05-20 06:45:37,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:37,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-20 06:45:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:37,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317236653] [2023-05-20 06:45:37,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317236653] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:37,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:37,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 06:45:37,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102403259] [2023-05-20 06:45:37,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:37,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 06:45:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:37,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 06:45:37,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 06:45:37,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:37,456 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:37,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:45:37,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:37,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:37,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 06:45:37,544 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:37,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1012824832, now seen corresponding path program 1 times [2023-05-20 06:45:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:37,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974712665] [2023-05-20 06:45:37,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:37,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:38,878 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-20 06:45:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:38,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974712665] [2023-05-20 06:45:38,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974712665] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:38,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:38,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-05-20 06:45:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46458450] [2023-05-20 06:45:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:38,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-20 06:45:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-20 06:45:38,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-05-20 06:45:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:38,890 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:38,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.705882352941177) internal successors, (114), 17 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:45:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-20 06:45:39,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 969017787, now seen corresponding path program 1 times [2023-05-20 06:45:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:39,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552244669] [2023-05-20 06:45:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:42,087 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-20 06:45:42,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:42,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552244669] [2023-05-20 06:45:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552244669] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:42,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:42,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-05-20 06:45:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779591888] [2023-05-20 06:45:42,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:42,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-05-20 06:45:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:42,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-05-20 06:45:42,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2023-05-20 06:45:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:42,092 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:42,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 26 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:45:42,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:42,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:42,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:42,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:44,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-20 06:45:44,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-20 06:45:44,189 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1518472118, now seen corresponding path program 1 times [2023-05-20 06:45:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:44,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233240631] [2023-05-20 06:45:44,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:44,264 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-20 06:45:44,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:44,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233240631] [2023-05-20 06:45:44,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233240631] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:44,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:44,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 06:45:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265272883] [2023-05-20 06:45:44,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:44,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 06:45:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:44,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 06:45:44,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 06:45:44,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:44,267 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:44,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:45:44,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:44,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:44,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:44,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-20 06:45:44,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:44,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:44,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:44,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-20 06:45:44,376 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:44,377 INFO L85 PathProgramCache]: Analyzing trace with hash -133683344, now seen corresponding path program 1 times [2023-05-20 06:45:44,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:44,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557482287] [2023-05-20 06:45:44,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:44,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:48,515 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-20 06:45:48,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:48,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557482287] [2023-05-20 06:45:48,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557482287] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:48,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:48,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-05-20 06:45:48,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215383386] [2023-05-20 06:45:48,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:48,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-20 06:45:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-20 06:45:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2023-05-20 06:45:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:48,518 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:48,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:45:48,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:48,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:48,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:48,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:48,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:48,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:50,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-20 06:45:50,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:50,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:50,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1901571075, now seen corresponding path program 1 times [2023-05-20 06:45:50,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:50,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870052734] [2023-05-20 06:45:50,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:50,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:51,018 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-20 06:45:51,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:51,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870052734] [2023-05-20 06:45:51,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870052734] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:51,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:51,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 06:45:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942033700] [2023-05-20 06:45:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:51,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 06:45:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:51,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 06:45:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 06:45:51,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:51,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:51,020 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-20 06:45:51,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:51,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:51,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:51,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:51,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:51,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:51,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:51,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:51,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:45:51,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-20 06:45:51,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:45:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:45:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1194863548, now seen corresponding path program 2 times [2023-05-20 06:45:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:45:51,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719089699] [2023-05-20 06:45:51,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:45:51,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:45:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:45:57,866 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-20 06:45:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:45:57,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719089699] [2023-05-20 06:45:57,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719089699] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:45:57,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:45:57,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-05-20 06:45:57,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374148881] [2023-05-20 06:45:57,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:45:57,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-20 06:45:57,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:45:57,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-20 06:45:57,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2023-05-20 06:45:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:45:57,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:45:57,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 4.1) internal successors, (123), 30 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:45:57,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:45:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:45:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:45:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:45:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:45:57,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:46:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:46:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:46:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-20 06:46:04,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-20 06:46:04,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:04,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:04,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1819819027, now seen corresponding path program 1 times [2023-05-20 06:46:04,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:04,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297762559] [2023-05-20 06:46:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:04,550 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-20 06:46:04,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:04,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297762559] [2023-05-20 06:46:04,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297762559] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:04,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:04,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 06:46:04,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819360225] [2023-05-20 06:46:04,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:04,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 06:46:04,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 06:46:04,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 06:46:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:04,555 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:04,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:04,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:04,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:04,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:46:04,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:46:04,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:04,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:46:04,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:04,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-20 06:46:04,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:46:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:46:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:05,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-20 06:46:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-05-20 06:46:05,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:05,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 06:46:05,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-20 06:46:05,346 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-05-20 06:46:05,348 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-20 06:46:05,354 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 06:46:05,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 06:46:05,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 06:46:05,356 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-20 06:46:05,358 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-20 06:46:05,399 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 06:46:05,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 06:46:05,401 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;@87e465c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 06:46:05,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-20 06:46:05,583 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-20 06:46:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1422695656, now seen corresponding path program 1 times [2023-05-20 06:46:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:05,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132031520] [2023-05-20 06:46:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:05,601 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-20 06:46:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:05,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132031520] [2023-05-20 06:46:05,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132031520] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:05,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:05,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 06:46:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728671694] [2023-05-20 06:46:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:05,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 06:46:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 06:46:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 06:46:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:05,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:05,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:05,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:05,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:05,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-20 06:46:05,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-20 06:46:05,619 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-20 06:46:05,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-20 06:46:05,622 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-20 06:46:05,622 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-20 06:46:05,625 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 06:46:05,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 06:46:05,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 06:46:05,628 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-20 06:46:05,633 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-20 06:46:05,635 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 06:46:05,637 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-20 06:46:05,637 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;@87e465c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 06:46:05,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-20 06:46:05,705 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1302976545, now seen corresponding path program 1 times [2023-05-20 06:46:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:05,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009579283] [2023-05-20 06:46:05,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:05,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:06,062 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-20 06:46:06,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:06,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009579283] [2023-05-20 06:46:06,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009579283] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:06,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:06,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-20 06:46:06,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567202488] [2023-05-20 06:46:06,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:06,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-20 06:46:06,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:06,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-20 06:46:06,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-20 06:46:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,064 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:06,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 12 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:06,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-20 06:46:06,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:06,342 INFO L85 PathProgramCache]: Analyzing trace with hash 976060243, now seen corresponding path program 1 times [2023-05-20 06:46:06,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:06,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94314471] [2023-05-20 06:46:06,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:06,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:06,405 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-20 06:46:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:06,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94314471] [2023-05-20 06:46:06,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94314471] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:06,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:06,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 06:46:06,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039434878] [2023-05-20 06:46:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:06,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 06:46:06,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:06,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 06:46:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 06:46:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,410 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:06,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:06,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-20 06:46:06,452 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:06,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash -373294042, now seen corresponding path program 1 times [2023-05-20 06:46:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:06,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976278266] [2023-05-20 06:46:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:06,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:06,542 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-20 06:46:06,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976278266] [2023-05-20 06:46:06,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976278266] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:06,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:06,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 06:46:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583410244] [2023-05-20 06:46:06,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:06,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 06:46:06,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:06,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 06:46:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 06:46:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,544 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:06,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:06,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-20 06:46:06,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:06,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash 462878420, now seen corresponding path program 1 times [2023-05-20 06:46:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:06,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091631154] [2023-05-20 06:46:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:06,648 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-20 06:46:06,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:06,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091631154] [2023-05-20 06:46:06,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091631154] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:06,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:06,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-20 06:46:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339482823] [2023-05-20 06:46:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:06,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-20 06:46:06,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:06,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-20 06:46:06,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-20 06:46:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:06,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:06,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,650 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-20 06:46:06,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:06,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1240084323, now seen corresponding path program 1 times [2023-05-20 06:46:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:06,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349637270] [2023-05-20 06:46:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:06,787 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-20 06:46:06,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:06,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349637270] [2023-05-20 06:46:06,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349637270] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:06,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:06,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 06:46:06,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793903600] [2023-05-20 06:46:06,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:06,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 06:46:06,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 06:46:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 06:46:06,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,789 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:06,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:06,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-20 06:46:06,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:06,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1431164263, now seen corresponding path program 1 times [2023-05-20 06:46:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:06,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614290326] [2023-05-20 06:46:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:06,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:06,958 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-20 06:46:06,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:06,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614290326] [2023-05-20 06:46:06,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614290326] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:06,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:06,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 06:46:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133202563] [2023-05-20 06:46:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:06,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 06:46:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:06,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 06:46:06,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 06:46:06,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:06,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:06,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:06,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:06,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:06,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:06,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:07,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:07,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-05-20 06:46:07,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:07,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:07,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2077085229, now seen corresponding path program 1 times [2023-05-20 06:46:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:07,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322981727] [2023-05-20 06:46:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:08,267 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-20 06:46:08,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322981727] [2023-05-20 06:46:08,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322981727] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 06:46:08,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 06:46:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-05-20 06:46:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515137867] [2023-05-20 06:46:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 06:46:08,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-20 06:46:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-20 06:46:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2023-05-20 06:46:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:08,268 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:08,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.058823529411764) internal successors, (205), 17 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:08,269 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:08,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:46:08,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-05-20 06:46:08,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:08,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash 650421582, now seen corresponding path program 1 times [2023-05-20 06:46:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:08,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7441961] [2023-05-20 06:46:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:14,083 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-20 06:46:14,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 06:46:14,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7441961] [2023-05-20 06:46:14,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7441961] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 06:46:14,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879479194] [2023-05-20 06:46:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:14,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 06:46:14,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 06:46:14,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 06:46:14,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 06:46:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 06:46:14,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 128 conjunts are in the unsatisfiable core [2023-05-20 06:46:14,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 06:46:14,509 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-20 06:46:14,510 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-20 06:46:14,567 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 06:46:14,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 06:46:14,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-20 06:46:14,858 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-20 06:46:15,524 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-20 06:46:15,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:15,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 06:46:15,991 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2023-05-20 06:46:15,991 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 39 [2023-05-20 06:46:16,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:16,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:16,102 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-20 06:46:16,279 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-20 06:46:16,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:16,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 06:46:16,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 06:46:17,523 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-05-20 06:46:17,524 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-20 06:46:17,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 06:46:17,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:17,834 INFO L356 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2023-05-20 06:46:17,835 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-20 06:46:18,102 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-20 06:46:18,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:18,284 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-20 06:46:18,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:18,890 INFO L356 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2023-05-20 06:46:18,891 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-20 06:46:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 06:46:19,137 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-20 06:46:19,144 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-20 06:46:19,144 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-20 06:46:19,299 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-20 06:46:19,348 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-20 06:46:19,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 06:46:19,573 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_679 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse1) 0)))) (or (not .cse0) (forall ((v_ArrVal_679 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse1) 1)))))) is different from false [2023-05-20 06:46:22,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_671 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673)))) (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_679) |c_~#stored_elements~0.base|) (+ (* |c_t2Thread1of1ForFork1_#t~post57#1| 4) 4 |~#stored_elements~0.offset|)) 0)) (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|))))))) is different from false [2023-05-20 06:46:31,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_671 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (store .cse2 |c_~#queue~0.base| (store (store (store (select .cse2 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (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 (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_679) |c_~#stored_elements~0.base|) (+ 4 |~#stored_elements~0.offset|)) 0))))) is different from false [2023-05-20 06:46:31,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_671 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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_668))) (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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-05-20 06:46:32,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_671 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)) 400)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-05-20 06:46:32,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_671 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-05-20 06:46:32,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_664 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_671 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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|) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_664) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-05-20 06:46:32,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_661 Int) (v_ArrVal_671 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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_661) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_664) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (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_679) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2023-05-20 06:46:32,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_661 Int) (v_ArrVal_671 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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| (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_661)) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_664) .cse5 v_ArrVal_666))) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (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_679) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2023-05-20 06:46:32,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_661 Int) (v_ArrVal_671 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| 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_#in~q#1.base| (let ((.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (store (store (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_661)) (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_664) .cse5 v_ArrVal_666))) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) (+ 1608 |c_~#queue~0.offset|) v_ArrVal_671) (+ |c_~#queue~0.offset| 1604) v_ArrVal_673))))) (store .cse2 |c_~#stored_elements~0.base| (store (select .cse2 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse1) 0)))))) is different from false [2023-05-20 06:46:32,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_661 Int) (v_ArrVal_671 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (|~#stored_elements~0.offset| Int) (v_ArrVal_666 Int)) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_661)) .cse4 v_ArrVal_664) .cse5 v_ArrVal_666)) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) .cse4 v_ArrVal_671) .cse5 v_ArrVal_673)))))) (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_679) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2023-05-20 06:46:33,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_666 Int) (v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_661 Int) (v_ArrVal_671 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse1 (+ 4 |~#stored_elements~0.offset|))) (let ((.cse0 (let ((.cse2 (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (store (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_660))) (store .cse6 |c_~#queue~0.base| (store (store (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_661)) .cse4 v_ArrVal_664) .cse5 v_ArrVal_666))) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (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|) .cse4 v_ArrVal_671) .cse5 v_ArrVal_673)))))) (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_679) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= 400 (select (select .cse0 |c_~#queue~0.base|) (+ 1600 |c_~#queue~0.offset|)))))))) is different from false [2023-05-20 06:46:34,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_659 Int) (v_ArrVal_660 (Array Int Int)) (v_ArrVal_666 Int) (v_ArrVal_667 (Array Int Int)) (v_ArrVal_664 Int) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_673 Int) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_661 Int) (v_ArrVal_671 Int) (|~#stored_elements~0.offset| Int)) (let ((.cse5 (+ 4 |~#stored_elements~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_659)))) (let ((.cse1 (+ 1600 |c_~#queue~0.offset|)) (.cse4 (let ((.cse6 (let ((.cse8 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse7 (store (store (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_660))) (store .cse9 |c_~#queue~0.base| (store (store (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse2))) v_ArrVal_661)) .cse8 v_ArrVal_664) .cse2 v_ArrVal_666))) |c_~#stored_elements~0.base| v_ArrVal_667) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_668))) (store .cse7 |c_~#queue~0.base| (store (store (store (select .cse7 |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_23|) |c_~#queue~0.offset|) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_671) .cse2 v_ArrVal_673)))))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) .cse5 |t1Thread1of1ForFork0_~value~0#1|))))) (or (not (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2)))) (not (= 400 (select (select .cse4 |c_~#queue~0.base|) .cse1))) (not (= (select (select (store .cse4 |c_~#queue~0.base| v_ArrVal_679) |c_~#stored_elements~0.base|) .cse5) 0)))))) is different from false [2023-05-20 06:46:34,237 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-20 06:46:34,237 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 1598 treesize of output 1226 [2023-05-20 06:46:34,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 06:46:34,361 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 5041 treesize of output 4967 [2023-05-20 06:46:34,399 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 4700 treesize of output 4252 [2023-05-20 06:46:34,452 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 4827 treesize of output 4687 [2023-05-20 06:46:34,506 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 5262 treesize of output 5122 [2023-05-20 06:46:34,564 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 1398 treesize of output 1222 [2023-05-20 06:46:35,268 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 85 treesize of output 73 [2023-05-20 06:46:35,295 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 06:46:35,296 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 321 treesize of output 279 [2023-05-20 06:46:36,376 INFO L356 Elim1Store]: treesize reduction 5, result has 93.8 percent of original size [2023-05-20 06:46:36,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 131 [2023-05-20 06:46:36,647 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-20 06:46:36,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879479194] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 06:46:36,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 06:46:36,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 46, 47] total 125 [2023-05-20 06:46:36,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439715292] [2023-05-20 06:46:36,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 06:46:36,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2023-05-20 06:46:36,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 06:46:36,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2023-05-20 06:46:36,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=784, Invalid=11642, Unknown=58, NotChecked=3016, Total=15500 [2023-05-20 06:46:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:36,655 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 06:46:36,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 4.752) internal successors, (594), 125 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 06:46:36,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:36,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:36,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:36,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:36,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:36,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:36,655 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:46:36,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 06:46:49,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 06:46:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-20 06:46:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 06:46:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 06:46:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-05-20 06:46:49,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 06:46:49,739 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,SelfDestructingSolverStorable17 [2023-05-20 06:46:49,740 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-20 06:46:49,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 06:46:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -463126327, now seen corresponding path program 1 times [2023-05-20 06:46:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 06:46:49,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803325716] [2023-05-20 06:46:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 06:46:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 06:46:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 06:46:49,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-20 06:46:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-20 06:46:49,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-20 06:46:49,996 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-20 06:46:49,996 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-20 06:46:49,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-05-20 06:46:49,999 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-20 06:46:49,999 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was UNSAFE (3/3) [2023-05-20 06:46:50,002 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 06:46:50,002 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 06:46:50,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 06:46:50 BasicIcfg [2023-05-20 06:46:50,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 06:46:50,231 INFO L158 Benchmark]: Toolchain (without parser) took 76237.30ms. Allocated memory was 186.6MB in the beginning and 1.0GB in the end (delta: 847.2MB). Free memory was 126.2MB in the beginning and 894.2MB in the end (delta: -768.0MB). Peak memory consumption was 607.7MB. Max. memory is 8.0GB. [2023-05-20 06:46:50,232 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 06:46:50,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.85ms. Allocated memory is still 186.6MB. Free memory was 126.0MB in the beginning and 138.9MB in the end (delta: -12.9MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. [2023-05-20 06:46:50,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.81ms. Allocated memory is still 186.6MB. Free memory was 138.9MB in the beginning and 135.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 06:46:50,232 INFO L158 Benchmark]: Boogie Preprocessor took 52.90ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 06:46:50,233 INFO L158 Benchmark]: RCFGBuilder took 593.43ms. Allocated memory is still 186.6MB. Free memory was 133.4MB in the beginning and 110.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-05-20 06:46:50,233 INFO L158 Benchmark]: TraceAbstraction took 74986.57ms. Allocated memory was 186.6MB in the beginning and 1.0GB in the end (delta: 847.2MB). Free memory was 109.8MB in the beginning and 894.2MB in the end (delta: -784.4MB). Peak memory consumption was 591.3MB. Max. memory is 8.0GB. [2023-05-20 06:46:50,242 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.13ms. Allocated memory is still 186.6MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 520.85ms. Allocated memory is still 186.6MB. Free memory was 126.0MB in the beginning and 138.9MB in the end (delta: -12.9MB). Peak memory consumption was 12.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 76.81ms. Allocated memory is still 186.6MB. Free memory was 138.9MB in the beginning and 135.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.90ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 593.43ms. Allocated memory is still 186.6MB. Free memory was 133.4MB in the beginning and 110.9MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 74986.57ms. Allocated memory was 186.6MB in the beginning and 1.0GB in the end (delta: 847.2MB). Free memory was 109.8MB in the beginning and 894.2MB in the end (delta: -784.4MB). Peak memory consumption was 591.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 25844, independent: 22947, independent conditional: 8699, independent unconditional: 14248, dependent: 2897, dependent conditional: 2826, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23094, independent: 22947, independent conditional: 8699, independent unconditional: 14248, dependent: 147, dependent conditional: 76, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23094, independent: 22947, independent conditional: 8699, independent unconditional: 14248, dependent: 147, dependent conditional: 76, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23885, independent: 22947, independent conditional: 81, independent unconditional: 22866, dependent: 938, dependent conditional: 710, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23885, independent: 22947, independent conditional: 81, independent unconditional: 22866, dependent: 938, dependent conditional: 307, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23885, independent: 22947, independent conditional: 81, independent unconditional: 22866, dependent: 938, dependent conditional: 307, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11977, independent: 11872, independent conditional: 15, independent unconditional: 11857, dependent: 105, dependent conditional: 34, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11977, independent: 11853, independent conditional: 0, independent unconditional: 11853, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 124, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 105, dependent conditional: 34, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 105, dependent conditional: 34, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 324, independent: 96, independent conditional: 48, independent unconditional: 48, dependent: 228, dependent conditional: 89, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23885, independent: 11075, independent conditional: 66, independent unconditional: 11009, dependent: 833, dependent conditional: 273, dependent unconditional: 560, unknown: 11977, unknown conditional: 49, unknown unconditional: 11928] , Statistics on independence cache: Total cache size (in pairs): 11977, Positive cache size: 11872, Positive conditional cache size: 15, Positive unconditional cache size: 11857, Negative cache size: 105, Negative conditional cache size: 34, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 403, Maximal queried relation: 8, Independence queries for same thread: 2750 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 2474, Number of trivial persistent sets: 1955, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14319, independent: 14248, independent conditional: 0, independent unconditional: 14248, 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: 25844, independent: 22947, independent conditional: 8699, independent unconditional: 14248, dependent: 2897, dependent conditional: 2826, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23094, independent: 22947, independent conditional: 8699, independent unconditional: 14248, dependent: 147, dependent conditional: 76, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 23094, independent: 22947, independent conditional: 8699, independent unconditional: 14248, dependent: 147, dependent conditional: 76, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23885, independent: 22947, independent conditional: 81, independent unconditional: 22866, dependent: 938, dependent conditional: 710, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23885, independent: 22947, independent conditional: 81, independent unconditional: 22866, dependent: 938, dependent conditional: 307, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23885, independent: 22947, independent conditional: 81, independent unconditional: 22866, dependent: 938, dependent conditional: 307, dependent unconditional: 631, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11977, independent: 11872, independent conditional: 15, independent unconditional: 11857, dependent: 105, dependent conditional: 34, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11977, independent: 11853, independent conditional: 0, independent unconditional: 11853, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 124, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 105, dependent conditional: 34, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 19, independent conditional: 15, independent unconditional: 4, dependent: 105, dependent conditional: 34, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 324, independent: 96, independent conditional: 48, independent unconditional: 48, dependent: 228, dependent conditional: 89, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 23885, independent: 11075, independent conditional: 66, independent unconditional: 11009, dependent: 833, dependent conditional: 273, dependent unconditional: 560, unknown: 11977, unknown conditional: 49, unknown unconditional: 11928] , Statistics on independence cache: Total cache size (in pairs): 11977, Positive cache size: 11872, Positive conditional cache size: 15, Positive unconditional cache size: 11857, Negative cache size: 105, Negative conditional cache size: 34, Negative unconditional cache size: 71, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 403, Maximal queried relation: 8, Independence queries for same thread: 2750 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9958, independent: 9551, independent conditional: 798, 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: 9666, independent: 9551, independent conditional: 798, 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: 9666, independent: 9551, independent conditional: 798, 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: 9686, independent: 9551, independent conditional: 0, independent unconditional: 9551, 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: 9686, independent: 9551, independent conditional: 0, independent unconditional: 9551, 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: 9686, independent: 9551, independent conditional: 0, independent unconditional: 9551, 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: 112, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9686, independent: 936, independent conditional: 0, independent unconditional: 936, 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: 535, Number of trivial persistent sets: 520, 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: 9958, independent: 9551, independent conditional: 798, 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: 9666, independent: 9551, independent conditional: 798, 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: 9666, independent: 9551, independent conditional: 798, 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: 9686, independent: 9551, independent conditional: 0, independent unconditional: 9551, 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: 9686, independent: 9551, independent conditional: 0, independent unconditional: 9551, 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: 9686, independent: 9551, independent conditional: 0, independent unconditional: 9551, 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: 112, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9686, independent: 936, independent conditional: 0, independent unconditional: 936, 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: 21104, independent: 19021, independent conditional: 5491, independent unconditional: 13530, dependent: 2083, dependent conditional: 2019, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19101, independent: 19021, independent conditional: 5491, independent unconditional: 13530, dependent: 80, dependent conditional: 16, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19101, independent: 19021, independent conditional: 5491, independent unconditional: 13530, dependent: 80, dependent conditional: 16, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19253, independent: 19021, independent conditional: 16, independent unconditional: 19005, dependent: 232, dependent conditional: 136, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19253, independent: 19021, independent conditional: 16, independent unconditional: 19005, dependent: 232, dependent conditional: 16, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19253, independent: 19021, independent conditional: 16, independent unconditional: 19005, dependent: 232, dependent conditional: 16, dependent unconditional: 216, 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: 125, independent: 34, independent conditional: 2, independent unconditional: 31, dependent: 91, dependent conditional: 6, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19253, independent: 7388, independent conditional: 14, independent unconditional: 7374, dependent: 166, dependent conditional: 14, dependent unconditional: 152, 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: 120, Maximal queried relation: 7, Independence queries for same thread: 2003 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 672, Number of trivial persistent sets: 445, 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: 21104, independent: 19021, independent conditional: 5491, independent unconditional: 13530, dependent: 2083, dependent conditional: 2019, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19101, independent: 19021, independent conditional: 5491, independent unconditional: 13530, dependent: 80, dependent conditional: 16, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19101, independent: 19021, independent conditional: 5491, independent unconditional: 13530, dependent: 80, dependent conditional: 16, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19253, independent: 19021, independent conditional: 16, independent unconditional: 19005, dependent: 232, dependent conditional: 136, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19253, independent: 19021, independent conditional: 16, independent unconditional: 19005, dependent: 232, dependent conditional: 16, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19253, independent: 19021, independent conditional: 16, independent unconditional: 19005, dependent: 232, dependent conditional: 16, dependent unconditional: 216, 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: 125, independent: 34, independent conditional: 2, independent unconditional: 31, dependent: 91, dependent conditional: 6, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19253, independent: 7388, independent conditional: 14, independent unconditional: 7374, dependent: 166, dependent conditional: 14, dependent unconditional: 152, 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: 120, Maximal queried relation: 7, Independence queries for same thread: 2003 - 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[(400)]; 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}] [L1062] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, pthread_create(&id1, ((void *)0), t1, &queue)=-1, queue={6:0}, stored_elements={7:0}] [L1007] 1 int value, i; VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1009] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1010] 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=0, 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=0, 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=0, 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=0, q->amount++=0, 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=0, queue={6:0}, stored_elements={7:0}, x=0] [L982] COND FALSE 1 !(q->tail == (400)) VAL [\old(x)=0, 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=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=0, 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=0, q->tail++=0, 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] [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=0] [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=0] [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=0] [L1018] 1 i=0 VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1063] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, pthread_create(&id2, ((void *)0), t2, &queue)=0, queue={6:0}, stored_elements={7:0}] [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<(400) 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}] [L1064] 0 \read(id1) VAL [\read(id1)=-1, dequeue_flag=0, enqueue_flag=1, id1={13:0}, id2={10:0}, m={5:0}, queue={6:0}, stored_elements={7:0}] [L1018] COND TRUE 1 i<((400)-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=0] [L1021] COND TRUE 1 \read(enqueue_flag) VAL [arg={6:0}, arg={6:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={5:0}, queue={6:0}, stored_elements={7:0}, value=0] [L1023] 1 value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, 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=1] [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail VAL [\old(x)=1, 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=1] [L980] 1 q->element[q->tail] = x VAL [\old(x)=1, 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=1] [L981] EXPR 1 q->amount VAL [\old(x)=1, 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=1] [L981] 1 q->amount++ VAL [\old(x)=1, 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=1] [L982] EXPR 1 q->tail VAL [\old(x)=1, 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=1] [L982] COND FALSE 1 !(q->tail == (400)) VAL [\old(x)=1, 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=1] [L988] EXPR 1 q->tail VAL [\old(x)=1, 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=1] [L988] 1 q->tail++ VAL [\old(x)=1, 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=1] [L990] 1 return 0; VAL [\old(x)=1, \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=1] [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=1] [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=1] [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=1] [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=1] [L1037] COND TRUE 2 i<(400) 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]=0, 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]=0, q->head=0, queue={6:0}, stored_elements={7:0}, x=0] [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=0] [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=0] [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=0] [L997] COND FALSE 2 !(q->head == (400)) 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=0] [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=0] [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=0] [L1003] 2 return x; VAL [\result=0, dequeue_flag=1, enqueue_flag=0, m={5:0}, q={6:0}, q={6:0}, queue={6:0}, stored_elements={7:0}, x=0] [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=1] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] VAL [arg={6:0}, arg={6:0}, dequeue(&queue)=0, dequeue_flag=1, enqueue_flag=0, i=1, m={5:0}, queue={6:0}, stored_elements={7:0}, stored_elements[i]=1] [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, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 29.8s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 13.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 132, 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, 16.0s InterpolantComputationTime, 1117 NumberOfCodeBlocks, 1117 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1108 ConstructedInterpolants, 0 QuantifiedInterpolants, 21631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 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, 429 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 44.4s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 14.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 95, 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, 29.3s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1807 ConstructedInterpolants, 179 QuantifiedInterpolants, 50141 SizeOfPredicates, 52 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 38/50 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-20 06:46:50,280 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-20 06:46:50,486 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-20 06:46:50,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-20 06:46:50,887 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...