/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 01:41:46,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 01:41:46,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 01:41:46,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 01:41:46,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 01:41:46,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 01:41:46,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 01:41:46,602 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 01:41:46,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 01:41:46,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 01:41:46,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 01:41:46,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 01:41:46,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 01:41:46,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 01:41:46,607 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 01:41:46,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 01:41:46,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 01:41:46,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 01:41:46,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 01:41:46,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 01:41:46,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 01:41:46,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 01:41:46,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 01:41:46,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 01:41:46,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 01:41:46,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 01:41:46,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 01:41:46,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 01:41:46,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 01:41:46,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 01:41:46,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 01:41:46,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 01:41:46,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 01:41:46,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 01:41:46,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 01:41:46,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 01:41:46,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 01:41:46,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 01:41:46,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 01:41:46,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 01:41:46,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 01:41:46,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 01:41:46,639 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 01:41:46,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 01:41:46,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 01:41:46,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 01:41:46,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 01:41:46,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 01:41:46,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 01:41:46,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 01:41:46,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 01:41:46,647 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 01:41:46,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 01:41:46,648 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 01:41:46,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 01:41:46,649 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 01:41:46,649 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 -> true [2023-05-04 01:41:46,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 01:41:46,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 01:41:46,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 01:41:46,886 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 01:41:46,886 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 01:41:46,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longest.i [2023-05-04 01:41:46,945 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d549c7d0/6d6abfa1ec1648d78e6b4fb559e9faca/FLAGcb2e42e21 [2023-05-04 01:41:47,387 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 01:41:47,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longest.i [2023-05-04 01:41:47,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d549c7d0/6d6abfa1ec1648d78e6b4fb559e9faca/FLAGcb2e42e21 [2023-05-04 01:41:47,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d549c7d0/6d6abfa1ec1648d78e6b4fb559e9faca [2023-05-04 01:41:47,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 01:41:47,419 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 01:41:47,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 01:41:47,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 01:41:47,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 01:41:47,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d13c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47, skipping insertion in model container [2023-05-04 01:41:47,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 01:41:47,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 01:41:47,735 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_longest.i[43296,43309] [2023-05-04 01:41:47,739 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_longest.i[43503,43516] [2023-05-04 01:41:47,741 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_longest.i[43783,43796] [2023-05-04 01:41:47,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 01:41:47,750 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 01:41:47,805 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_longest.i[43296,43309] [2023-05-04 01:41:47,809 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_longest.i[43503,43516] [2023-05-04 01:41:47,817 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_longest.i[43783,43796] [2023-05-04 01:41:47,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 01:41:47,866 INFO L208 MainTranslator]: Completed translation [2023-05-04 01:41:47,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47 WrapperNode [2023-05-04 01:41:47,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 01:41:47,868 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 01:41:47,868 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 01:41:47,868 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 01:41:47,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,917 INFO L138 Inliner]: procedures = 274, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2023-05-04 01:41:47,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 01:41:47,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 01:41:47,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 01:41:47,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 01:41:47,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,945 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 01:41:47,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 01:41:47,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 01:41:47,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 01:41:47,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (1/1) ... [2023-05-04 01:41:47,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 01:41:47,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:41:48,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-04 01:41:48,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-05-04 01:41:48,052 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-05-04 01:41:48,052 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 01:41:48,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 01:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 01:41:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 01:41:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 01:41:48,054 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 01:41:48,181 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 01:41:48,184 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 01:41:48,415 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 01:41:48,422 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 01:41:48,422 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-04 01:41:48,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 01:41:48 BoogieIcfgContainer [2023-05-04 01:41:48,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 01:41:48,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 01:41:48,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 01:41:48,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 01:41:48,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 01:41:47" (1/3) ... [2023-05-04 01:41:48,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d333d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 01:41:48, skipping insertion in model container [2023-05-04 01:41:48,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 01:41:47" (2/3) ... [2023-05-04 01:41:48,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d333d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 01:41:48, skipping insertion in model container [2023-05-04 01:41:48,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 01:41:48" (3/3) ... [2023-05-04 01:41:48,429 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2023-05-04 01:41:48,434 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 01:41:48,440 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 01:41:48,440 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-05-04 01:41:48,440 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 01:41:48,580 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 01:41:48,642 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:41:48,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 01:41:48,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:41:48,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 01:41:48,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 01:41:48,702 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 01:41:48,723 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2023-05-04 01:41:48,727 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;@8605d05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:41:48,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 01:41:48,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:41:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:41:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1596867909, now seen corresponding path program 1 times [2023-05-04 01:41:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:41:48,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100773243] [2023-05-04 01:41:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:41:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:41:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:41:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:41:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:41:49,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100773243] [2023-05-04 01:41:49,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100773243] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:41:49,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:41:49,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 01:41:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166327586] [2023-05-04 01:41:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:41:49,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 01:41:49,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:41:49,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 01:41:49,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 01:41:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:49,933 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:41:49,934 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-04 01:41:49,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:50,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 01:41:50,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:41:50,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:41:50,230 INFO L85 PathProgramCache]: Analyzing trace with hash 205824109, now seen corresponding path program 1 times [2023-05-04 01:41:50,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:41:50,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224702189] [2023-05-04 01:41:50,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:41:50,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:41:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:41:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:41:50,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:41:50,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224702189] [2023-05-04 01:41:50,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224702189] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:41:50,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:41:50,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 01:41:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863113345] [2023-05-04 01:41:50,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:41:50,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 01:41:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:41:50,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 01:41:50,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 01:41:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:50,309 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:41:50,310 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-04 01:41:50,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:50,310 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:50,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 01:41:50,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:41:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:41:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1012824832, now seen corresponding path program 1 times [2023-05-04 01:41:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:41:50,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494655702] [2023-05-04 01:41:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:41:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:41:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:41:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:41:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:41:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494655702] [2023-05-04 01:41:51,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494655702] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:41:51,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:41:51,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-05-04 01:41:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046669172] [2023-05-04 01:41:51,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:41:51,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-04 01:41:51,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:41:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-04 01:41:51,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-05-04 01:41:51,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:51,584 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:41:51,586 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-04 01:41:51,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:51,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:51,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:52,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:41:52,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 01:41:52,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:41:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:41:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 969017787, now seen corresponding path program 1 times [2023-05-04 01:41:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:41:52,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102872251] [2023-05-04 01:41:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:41:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:41:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:41:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:41:54,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:41:54,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102872251] [2023-05-04 01:41:54,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102872251] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:41:54,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:41:54,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-05-04 01:41:54,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10261003] [2023-05-04 01:41:54,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:41:54,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-05-04 01:41:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:41:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-05-04 01:41:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2023-05-04 01:41:54,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:54,538 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:41:54,538 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-04 01:41:54,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:54,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:54,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:41:54,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:41:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-05-04 01:41:56,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 01:41:56,502 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:41:56,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:41:56,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1518472118, now seen corresponding path program 1 times [2023-05-04 01:41:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:41:56,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90521525] [2023-05-04 01:41:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:41:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:41:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:41:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:41:56,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:41:56,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90521525] [2023-05-04 01:41:56,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90521525] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:41:56,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:41:56,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 01:41:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081699312] [2023-05-04 01:41:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:41:56,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 01:41:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:41:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 01:41:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 01:41:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:56,560 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:41:56,561 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-04 01:41:56,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:56,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:56,561 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:41:56,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-05-04 01:41:56,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:41:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:41:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:41:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:41:56,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:41:56,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 01:41:56,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:41:56,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:41:56,674 INFO L85 PathProgramCache]: Analyzing trace with hash -133683344, now seen corresponding path program 1 times [2023-05-04 01:41:56,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:41:56,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462218567] [2023-05-04 01:41:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:41:56,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:41:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:00,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:00,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462218567] [2023-05-04 01:42:00,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462218567] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:00,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:00,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2023-05-04 01:42:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387157244] [2023-05-04 01:42:00,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:00,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-05-04 01:42:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:00,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-05-04 01:42:00,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2023-05-04 01:42:00,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:00,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:00,047 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-04 01:42:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:00,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:02,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 01:42:02,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:02,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:02,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1940192969, now seen corresponding path program 1 times [2023-05-04 01:42:02,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:02,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771208984] [2023-05-04 01:42:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:02,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:02,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:02,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771208984] [2023-05-04 01:42:02,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771208984] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:02,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:02,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 01:42:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653261180] [2023-05-04 01:42:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:02,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 01:42:02,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:02,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 01:42:02,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 01:42:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:02,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:02,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:02,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:02,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:02,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:02,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:02,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:02,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:02,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:02,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 01:42:02,456 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1194863548, now seen corresponding path program 2 times [2023-05-04 01:42:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:02,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220189082] [2023-05-04 01:42:02,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:04,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220189082] [2023-05-04 01:42:04,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220189082] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:04,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:04,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-05-04 01:42:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386564476] [2023-05-04 01:42:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-05-04 01:42:04,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:04,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-05-04 01:42:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2023-05-04 01:42:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:04,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:04,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.392857142857143) internal successors, (123), 28 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-04 01:42:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:04,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:04,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:04,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:04,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 01:42:07,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:07,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:07,244 INFO L85 PathProgramCache]: Analyzing trace with hash -161202014, now seen corresponding path program 1 times [2023-05-04 01:42:07,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:07,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512472034] [2023-05-04 01:42:07,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:07,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:07,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512472034] [2023-05-04 01:42:07,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512472034] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:07,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:07,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 01:42:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98247868] [2023-05-04 01:42:07,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:07,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 01:42:07,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:07,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 01:42:07,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 01:42:07,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:07,310 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:07,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-05-04 01:42:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:07,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 01:42:07,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-05-04 01:42:07,430 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 01:42:07,431 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2023-05-04 01:42:07,435 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:42:07,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 01:42:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:42:07,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 01:42:07,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-05-04 01:42:07,471 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 01:42:07,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 01:42:07,476 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;@8605d05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:42:07,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-04 01:42:07,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-04 01:42:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1422695656, now seen corresponding path program 1 times [2023-05-04 01:42:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:07,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173422893] [2023-05-04 01:42:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:07,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:07,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173422893] [2023-05-04 01:42:07,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173422893] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:07,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:07,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 01:42:07,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293949854] [2023-05-04 01:42:07,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:07,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 01:42:07,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:07,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 01:42:07,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 01:42:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:07,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:07,651 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-04 01:42:07,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:07,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:07,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-04 01:42:07,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-04 01:42:07,663 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-04 01:42:07,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-05-04 01:42:07,665 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2023-05-04 01:42:07,665 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2023-05-04 01:42:07,667 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:42:07,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 01:42:07,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:42:07,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 01:42:07,671 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 01:42:07,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2023-05-04 01:42:07,674 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;@8605d05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 01:42:07,674 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-05-04 01:42:07,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-05-04 01:42:07,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:07,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1530553238, now seen corresponding path program 1 times [2023-05-04 01:42:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:07,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284581710] [2023-05-04 01:42:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:07,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:07,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284581710] [2023-05-04 01:42:07,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284581710] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:07,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:07,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-05-04 01:42:07,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830189679] [2023-05-04 01:42:07,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:07,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 01:42:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 01:42:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 01:42:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:07,983 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:07,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:07,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-05-04 01:42:08,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1562564856, now seen corresponding path program 1 times [2023-05-04 01:42:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:08,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59358658] [2023-05-04 01:42:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:08,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:08,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59358658] [2023-05-04 01:42:08,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59358658] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:08,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:08,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 01:42:08,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199680378] [2023-05-04 01:42:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 01:42:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 01:42:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 01:42:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,258 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:08,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:08,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-05-04 01:42:08,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 363124933, now seen corresponding path program 1 times [2023-05-04 01:42:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:08,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433623898] [2023-05-04 01:42:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:08,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433623898] [2023-05-04 01:42:08,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433623898] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:08,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:08,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 01:42:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440227639] [2023-05-04 01:42:08,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:08,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 01:42:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:08,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 01:42:08,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 01:42:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,394 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:08,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:08,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:08,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-05-04 01:42:08,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:08,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:08,453 INFO L85 PathProgramCache]: Analyzing trace with hash -295465292, now seen corresponding path program 1 times [2023-05-04 01:42:08,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:08,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842389355] [2023-05-04 01:42:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:08,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:08,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:08,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842389355] [2023-05-04 01:42:08,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842389355] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:08,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:08,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-05-04 01:42:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119484341] [2023-05-04 01:42:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:08,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-05-04 01:42:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:08,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-05-04 01:42:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-05-04 01:42:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:08,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 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-04 01:42:08,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:08,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-05-04 01:42:08,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:08,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:08,534 INFO L85 PathProgramCache]: Analyzing trace with hash -963070267, now seen corresponding path program 1 times [2023-05-04 01:42:08,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:08,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159838016] [2023-05-04 01:42:08,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:08,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:08,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:08,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159838016] [2023-05-04 01:42:08,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159838016] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:08,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:08,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-04 01:42:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283985642] [2023-05-04 01:42:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:08,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-04 01:42:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:08,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-04 01:42:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-04 01:42:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,600 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:08,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:08,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:08,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:08,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-05-04 01:42:08,661 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash -972956197, now seen corresponding path program 1 times [2023-05-04 01:42:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:08,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121697005] [2023-05-04 01:42:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:09,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121697005] [2023-05-04 01:42:09,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121697005] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:09,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:09,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-05-04 01:42:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691729668] [2023-05-04 01:42:09,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:09,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-04 01:42:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-04 01:42:09,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-05-04 01:42:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:09,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:09,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.764705882352942) internal successors, (200), 17 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:09,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:09,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:09,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:09,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:09,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:09,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:09,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:09,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-05-04 01:42:09,904 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:09,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1169226838, now seen corresponding path program 1 times [2023-05-04 01:42:09,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:09,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273319226] [2023-05-04 01:42:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:09,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:14,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:14,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273319226] [2023-05-04 01:42:14,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273319226] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:14,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:14,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2023-05-04 01:42:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178710547] [2023-05-04 01:42:14,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:14,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-05-04 01:42:14,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-05-04 01:42:14,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2023-05-04 01:42:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:14,599 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:14,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.666666666666667) internal successors, (204), 36 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:14,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:14,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:14,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:14,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:14,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:14,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:14,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:17,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 01:42:17,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-05-04 01:42:17,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:17,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:17,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2008994769, now seen corresponding path program 1 times [2023-05-04 01:42:17,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:17,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498902194] [2023-05-04 01:42:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498902194] [2023-05-04 01:42:22,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498902194] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 01:42:22,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 01:42:22,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2023-05-04 01:42:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693185882] [2023-05-04 01:42:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 01:42:22,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-05-04 01:42:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 01:42:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-05-04 01:42:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2085, Unknown=0, NotChecked=0, Total=2256 [2023-05-04 01:42:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:22,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 01:42:22,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 4.333333333333333) internal successors, (208), 48 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-05-04 01:42:22,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 01:42:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-04 01:42:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-05-04 01:42:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-04 01:42:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-04 01:42:29,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-05-04 01:42:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-05-04 01:42:29,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-05-04 01:42:29,786 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-05-04 01:42:29,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 01:42:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash 2120910101, now seen corresponding path program 1 times [2023-05-04 01:42:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 01:42:29,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479833806] [2023-05-04 01:42:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 01:42:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 01:42:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479833806] [2023-05-04 01:42:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479833806] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 01:42:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921807574] [2023-05-04 01:42:34,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 01:42:34,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:42:34,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 01:42:34,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-04 01:42:34,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-04 01:42:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 01:42:34,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 174 conjunts are in the unsatisfiable core [2023-05-04 01:42:34,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 01:42:35,019 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 01:42:35,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-04 01:42:35,095 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-04 01:42:35,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-04 01:42:35,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-05-04 01:42:35,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-05-04 01:42:36,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2023-05-04 01:42:36,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:36,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:42:36,673 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-05-04 01:42:36,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2023-05-04 01:42:36,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:36,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:36,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2023-05-04 01:42:37,094 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 46 treesize of output 27 [2023-05-04 01:42:37,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:37,276 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 31 [2023-05-04 01:42:37,965 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 31 [2023-05-04 01:42:38,781 INFO L356 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2023-05-04 01:42:38,781 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 2 case distinctions, treesize of input 42 treesize of output 58 [2023-05-04 01:42:39,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:39,089 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:42:39,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:39,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:39,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 01:42:39,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:39,105 INFO L356 Elim1Store]: treesize reduction 57, result has 23.0 percent of original size [2023-05-04 01:42:39,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 93 treesize of output 86 [2023-05-04 01:42:39,440 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 63 treesize of output 38 [2023-05-04 01:42:39,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:39,591 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 36 treesize of output 29 [2023-05-04 01:42:40,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:40,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:40,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-05-04 01:42:40,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:40,551 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 50 treesize of output 31 [2023-05-04 01:42:41,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:41,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:41,435 INFO L356 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-05-04 01:42:41,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 63 [2023-05-04 01:42:41,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:41,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:41,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:41,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2023-05-04 01:42:42,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:42,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2023-05-04 01:42:42,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:42,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:42,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2023-05-04 01:42:42,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:42,798 INFO L356 Elim1Store]: treesize reduction 25, result has 34.2 percent of original size [2023-05-04 01:42:42,798 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 58 treesize of output 60 [2023-05-04 01:42:43,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 01:42:43,103 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 42 treesize of output 36 [2023-05-04 01:42:43,109 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-05-04 01:42:43,109 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 28 treesize of output 26 [2023-05-04 01:42:43,298 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 15 treesize of output 7 [2023-05-04 01:42:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 01:42:43,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 01:43:00,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int)) (let ((.cse6 (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_737) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_740)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store (store .cse4 .cse7 v_ArrVal_743) .cse1 v_ArrVal_746) (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_748))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_749) .cse3 v_ArrVal_752)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) .cse1))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)) (= (select .cse2 .cse3) 800) (< (+ (select .cse4 .cse1) 1) v_ArrVal_746))))))) is different from false [2023-05-04 01:43:05,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int)) (let ((.cse6 (let ((.cse8 (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_~q#1.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |c_t1Thread1of1ForFork0_enqueue_#in~x#1|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_737) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_740)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |c_t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse1 (select .cse6 |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse3 (store (store (store .cse1 .cse7 v_ArrVal_743) .cse2 v_ArrVal_746) (+ (* 4 (select .cse1 .cse4)) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_749) .cse4 v_ArrVal_752)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_746) (not (= 800 (select (select .cse0 |c_~#queue~0.base|) .cse2))) (= 800 (select .cse3 .cse4)))))))) is different from false [2023-05-04 01:43:11,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (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|) .cse7 v_ArrVal_737) .cse4 v_ArrVal_740)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse0 .cse7 v_ArrVal_743) .cse1 v_ArrVal_746) (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_749) .cse4 v_ArrVal_752)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_746) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) .cse1))) (= (select .cse3 .cse4) 800) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) (+ (* 4 |c_t2Thread1of1ForFork1_~i~1#1|) |c_~#stored_elements~0.offset| 4)) 0))))))))) is different from false [2023-05-04 01:43:12,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (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|) .cse7 v_ArrVal_737) .cse4 v_ArrVal_740)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store (store (store .cse0 .cse7 v_ArrVal_743) .cse1 v_ArrVal_746) (+ (* (select .cse0 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse2 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse7 v_ArrVal_749) .cse4 v_ArrVal_752)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_746) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) .cse1))) (= (select .cse3 .cse4) 800) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4)) 0))))))))) is different from false [2023-05-04 01:43:13,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (let ((.cse8 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse9 |c_~#queue~0.base| (store (store (store (select .cse9 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse7 v_ArrVal_737) .cse2 v_ArrVal_740))))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4 (* |c_t1Thread1of1ForFork0_~i~0#1| 4)) |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (store (store (store .cse3 .cse7 v_ArrVal_743) .cse4 v_ArrVal_746) (+ |c_~#queue~0.offset| (* 4 (select .cse3 .cse2))) v_ArrVal_748))) (let ((.cse0 (let ((.cse5 (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse7 v_ArrVal_749) .cse2 v_ArrVal_752)))) (store .cse5 |c_~#stored_elements~0.base| (store (select .cse5 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (< |v_t1Thread1of1ForFork0_~i~0#1_18| (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 4)) 0)) (= (select .cse1 .cse2) 800) (< (+ (select .cse3 .cse4) 1) v_ArrVal_746) (not (= (select (select .cse0 |c_~#queue~0.base|) .cse4) 800))))))))) is different from false [2023-05-04 01:43:13,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_737) .cse5 v_ArrVal_740))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse8 v_ArrVal_743) .cse1 v_ArrVal_746) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_749) .cse5 v_ArrVal_752)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse2) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse3 .cse1) 1) v_ArrVal_746) (= (select .cse4 .cse5) 800)))))))) is different from false [2023-05-04 01:43:14,441 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| |c_t1Thread1of1ForFork0_empty_#t~mem32#1|) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_737) .cse5 v_ArrVal_740))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse8 v_ArrVal_743) .cse1 v_ArrVal_746) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_749) .cse5 v_ArrVal_752)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse2) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse3 .cse1) 1) v_ArrVal_746) (= (select .cse4 .cse5) 800))))))))) is different from false [2023-05-04 01:43:14,553 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_empty_#t~mem31#1| (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_737) .cse5 v_ArrVal_740))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse8 v_ArrVal_743) .cse1 v_ArrVal_746) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_749) .cse5 v_ArrVal_752)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse2) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse3 .cse1) 1) v_ArrVal_746) (= (select .cse4 .cse5) 800))))))))) is different from false [2023-05-04 01:43:14,722 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_~q#1.base|))) (= (select .cse0 (+ 3204 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)) (select .cse0 (+ 3200 |c_t1Thread1of1ForFork0_empty_~q#1.offset|)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_737) .cse6 v_ArrVal_740))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store (store .cse4 .cse9 v_ArrVal_743) .cse2 v_ArrVal_746) (+ (* (select .cse4 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse1 (let ((.cse7 (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_749) .cse6 v_ArrVal_752)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse1 |c_~#queue~0.base|) .cse2) 800)) (not (= (select (select (store .cse1 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse3) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse4 .cse2) 1) v_ArrVal_746) (= (select .cse5 .cse6) 800))))))))) is different from false [2023-05-04 01:43:14,848 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_empty_#in~q#1.base|))) (= (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 3200)) (select .cse0 (+ |c_t1Thread1of1ForFork0_empty_#in~q#1.offset| 3204)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 4)) (.cse9 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 3204))) (let ((.cse8 (let ((.cse10 (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse11 |c_~#queue~0.base| (store (store (store (select .cse11 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse9 v_ArrVal_737) .cse6 v_ArrVal_740))))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) .cse3 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store (store .cse4 .cse9 v_ArrVal_743) .cse2 v_ArrVal_746) (+ (* (select .cse4 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse1 (let ((.cse7 (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_749) .cse6 v_ArrVal_752)))) (store .cse7 |c_~#stored_elements~0.base| (store (select .cse7 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse1 |c_~#queue~0.base|) .cse2) 800)) (not (= (select (select (store .cse1 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse3) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse4 .cse2) 1) v_ArrVal_746) (= (select .cse5 .cse6) 800))))))))) is different from false [2023-05-04 01:43:15,202 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse1 (+ 3200 |c_~#queue~0.offset|))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse2 (+ |c_~#stored_elements~0.offset| 4)) (.cse8 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (let ((.cse9 (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse10 |c_~#queue~0.base| (store (store (store (select .cse10 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse8 v_ArrVal_737) .cse5 v_ArrVal_740))))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) .cse2 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse8 v_ArrVal_743) .cse1 v_ArrVal_746) (+ (* (select .cse3 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse6 (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_749) .cse5 v_ArrVal_752)))) (store .cse6 |c_~#stored_elements~0.base| (store (select .cse6 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse2) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse3 .cse1) 1) v_ArrVal_746) (= (select .cse4 .cse5) 800)))))))) (let ((.cse11 (select |c_#memory_int| |c_~#queue~0.base|))) (= (select .cse11 .cse5) (select .cse11 .cse1))))) is different from false [2023-05-04 01:43:15,504 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_737) .cse5 v_ArrVal_740))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse2 .cse10 v_ArrVal_743) .cse3 v_ArrVal_746) (+ (* (select .cse2 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_749) .cse5 v_ArrVal_752)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse1) 0)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_746) (= (select .cse4 .cse5) 800) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse3) (select .cse6 .cse5))) (not (= (select (select .cse0 |c_~#queue~0.base|) .cse3) 800))))))))) is different from false [2023-05-04 01:43:16,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_737) .cse1 v_ArrVal_740))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store (store (store .cse7 .cse10 v_ArrVal_743) .cse3 v_ArrVal_746) (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse10 v_ArrVal_749) .cse1 v_ArrVal_752)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (= 800 (select .cse0 .cse1)) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 .cse3))) (not (= 0 (select (select (store .cse5 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse6))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse7 .cse3) 1) v_ArrVal_746) (not (= (select (select .cse5 |c_~#queue~0.base|) .cse3) 800))))))))) is different from false [2023-05-04 01:43:17,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_737) .cse5 v_ArrVal_740))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store (store (store .cse3 .cse10 v_ArrVal_743) .cse2 v_ArrVal_746) (+ (* 4 (select .cse3 .cse5)) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse10 v_ArrVal_749) .cse5 v_ArrVal_752)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse1) 0)) (not (= (select (select .cse0 |c_~#queue~0.base|) .cse2) 800)) (< (+ (select .cse3 .cse2) 1) v_ArrVal_746) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (= 800 (select .cse4 .cse5)) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse5) (select .cse6 .cse2)))))))))) is different from false [2023-05-04 01:43:17,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse13 .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_737) .cse4 v_ArrVal_740))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse0 .cse10 v_ArrVal_743) .cse1 v_ArrVal_746) (+ |c_~#queue~0.offset| (* (select .cse0 .cse4) 4)) v_ArrVal_748))) (let ((.cse2 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_749) .cse4 v_ArrVal_752)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_746) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (not (= 800 (select (select .cse2 |c_~#queue~0.base|) .cse1))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 .cse4))) (not (= (select (select (store .cse2 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse6) 0)) (= 800 (select .cse7 .cse4))))))))) is different from false [2023-05-04 01:43:18,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_729 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse1 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_729) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_737) .cse3 v_ArrVal_740))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse1 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse4 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse6 .cse10 v_ArrVal_743) .cse4 v_ArrVal_746) (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_749) .cse3 v_ArrVal_752)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse1) 0)) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (= (select .cse2 .cse3) (select .cse2 .cse4))) (not (= (select (select .cse0 |c_~#queue~0.base|) .cse4) 800)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse6 .cse4) 1) v_ArrVal_746) (= 800 (select .cse7 .cse3))))))))) is different from false [2023-05-04 01:43:19,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_727 Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse4 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (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_727)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_729) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse7 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_737) .cse3 v_ArrVal_740))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse4 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse5 .cse10 v_ArrVal_743) .cse1 v_ArrVal_746) (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse3))) v_ArrVal_748))) (let ((.cse0 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_749) .cse3 v_ArrVal_752)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (= 800 (select .cse2 .cse3)) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse4) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (< (+ (select .cse5 .cse1) 1) v_ArrVal_746) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (= (select .cse6 .cse3) (select .cse6 .cse1)))))))))) is different from false [2023-05-04 01:43:20,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int)) (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_729 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_727 Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (+ 3208 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_727))) (store (store .cse13 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_729) .cse14 (+ (select .cse13 .cse14) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse9 (let ((.cse11 (let ((.cse12 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse12 |c_~#queue~0.base| (store (store (store (select .cse12 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_~value~0#1|) .cse10 v_ArrVal_737) .cse4 v_ArrVal_740))))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store (store (store .cse2 .cse10 v_ArrVal_743) .cse1 v_ArrVal_746) (+ |c_~#queue~0.offset| (* (select .cse2 .cse4) 4)) v_ArrVal_748))) (let ((.cse0 (let ((.cse8 (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_749) .cse4 v_ArrVal_752)))) (store .cse8 |c_~#stored_elements~0.base| (store (select .cse8 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_746) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (= (select .cse3 .cse1) (select .cse3 .cse4))) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse6) 0)) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (= 800 (select .cse7 .cse4))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| (select .cse15 .cse14)))))) is different from false [2023-05-04 01:43:21,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_727 Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 3204)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse6 (+ |c_~#stored_elements~0.offset| 4)) (.cse12 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse15 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_727))) (store (store .cse15 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_729) .cse9 (+ (select .cse15 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store .cse4 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse14 |c_~#queue~0.base| (store (store (store (select .cse14 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_~value~0#1|) .cse12 v_ArrVal_737) .cse3 v_ArrVal_740))))) (store .cse13 |c_~#stored_elements~0.base| (store (select .cse13 |c_~#stored_elements~0.base|) .cse6 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store (store (store .cse7 .cse12 v_ArrVal_743) .cse1 v_ArrVal_746) (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_748))) (let ((.cse0 (let ((.cse10 (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse12 v_ArrVal_749) .cse3 v_ArrVal_752)))) (store .cse10 |c_~#stored_elements~0.base| (store (select .cse10 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (= (select .cse2 .cse1) (select .cse2 .cse3))) (= (select .cse5 .cse3) 800) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse6) 0)) (< (+ (select .cse7 .cse1) 1) v_ArrVal_746) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| (select .cse8 .cse9))))))))))) is different from false [2023-05-04 01:43:22,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_727 Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse14 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_727))) (store (store .cse14 .cse11 v_ArrVal_729) .cse3 (+ (select .cse14 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store .cse5 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse13 |c_~#queue~0.base| (store (store (store (select .cse13 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_~value~0#1|) .cse11 v_ArrVal_737) .cse3 v_ArrVal_740))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse1 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store (store (store .cse6 .cse11 v_ArrVal_743) .cse1 v_ArrVal_746) (+ (* 4 (select .cse6 .cse3)) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse0 (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_749) .cse3 v_ArrVal_752)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (= (select (select .cse0 |c_~#queue~0.base|) .cse1) 800)) (= (select .cse2 .cse3) 800) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (= (select .cse4 .cse1) (select .cse4 .cse3))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_746) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| (select .cse7 .cse3))) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (not (= (select (select (store .cse0 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse8) 0)))))))))) is different from false [2023-05-04 01:43:25,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_727 Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_726))) (let ((.cse11 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse14 |c_~#queue~0.base|))) (let ((.cse8 (+ |c_~#stored_elements~0.offset| 4)) (.cse3 (store (store .cse14 |c_~#queue~0.base| (let ((.cse15 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_727))) (store (store .cse15 .cse11 v_ArrVal_729) .cse1 (+ (select .cse15 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse10 (let ((.cse12 (let ((.cse13 (store .cse3 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse13 |c_~#queue~0.base| (store (store (store (select .cse13 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_~value~0#1|) .cse11 v_ArrVal_737) .cse1 v_ArrVal_740))))) (store .cse12 |c_~#stored_elements~0.base| (store (select .cse12 |c_~#stored_elements~0.base|) .cse8 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse2 (+ 3200 |c_~#queue~0.offset|)) (.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store (store (store .cse6 .cse11 v_ArrVal_743) .cse2 v_ArrVal_746) (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse7 (let ((.cse9 (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_749) .cse1 v_ArrVal_752)))) (store .cse9 |c_~#stored_elements~0.base| (store (select .cse9 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (= (select .cse0 .cse1) (select .cse0 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| (select .cse4 .cse1))) (= (select .cse5 .cse1) 800) (< (+ (select .cse6 .cse2) 1) v_ArrVal_746) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (not (= (select (select .cse7 |c_~#queue~0.base|) .cse2) 800)) (not (= (select (select (store .cse7 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse8) 0))))))))))) is different from false [2023-05-04 01:43:38,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 Int) (|t1Thread1of1ForFork0_~value~0#1| Int) (v_ArrVal_727 Int) (v_ArrVal_749 Int) (v_ArrVal_737 Int) (v_ArrVal_748 Int) (v_ArrVal_724 Int) (v_ArrVal_746 Int) (v_ArrVal_743 Int) (v_ArrVal_754 Int) (v_ArrVal_733 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_740 Int) (v_ArrVal_757 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26| Int) (|v_t1Thread1of1ForFork0_~i~0#1_18| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_724)))) (let ((.cse16 (store .cse5 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_726))) (let ((.cse13 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse16 |c_~#queue~0.base|))) (let ((.cse7 (+ |c_~#stored_elements~0.offset| 4)) (.cse10 (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27|) |c_~#queue~0.offset|) v_ArrVal_727))) (store (store .cse17 .cse13 v_ArrVal_729) .cse1 (+ (select .cse17 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_733))) (let ((.cse12 (let ((.cse14 (let ((.cse15 (store .cse10 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_734))) (store .cse15 |c_~#queue~0.base| (store (store (store (select .cse15 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_26|)) |t1Thread1of1ForFork0_~value~0#1|) .cse13 v_ArrVal_737) .cse1 v_ArrVal_740))))) (store .cse14 |c_~#stored_elements~0.base| (store (select .cse14 |c_~#stored_elements~0.base|) .cse7 |t1Thread1of1ForFork0_~value~0#1|))))) (let ((.cse3 (+ 3200 |c_~#queue~0.offset|)) (.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store (store (store .cse2 .cse13 v_ArrVal_743) .cse3 v_ArrVal_746) (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_748))) (let ((.cse6 (let ((.cse11 (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse13 v_ArrVal_749) .cse1 v_ArrVal_752)))) (store .cse11 |c_~#stored_elements~0.base| (store (select .cse11 |c_~#stored_elements~0.base|) (+ (* |v_t1Thread1of1ForFork0_~i~0#1_18| 4) |c_~#stored_elements~0.offset| 4) v_ArrVal_754))))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_27| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_746) (< |v_t1Thread1of1ForFork0_~i~0#1_18| 1) (not (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (= (select .cse4 .cse3) (select .cse4 .cse1)))) (not (= (select (select .cse6 |c_~#queue~0.base|) .cse3) 800)) (not (= (select (select (store .cse6 |c_~#queue~0.base| v_ArrVal_757) |c_~#stored_elements~0.base|) .cse7) 0)) (= (select .cse8 .cse1) 800) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (= (select .cse9 .cse3) (select .cse9 .cse1))))))))))))) is different from false [2023-05-04 01:43:41,919 INFO L356 Elim1Store]: treesize reduction 96, result has 47.0 percent of original size [2023-05-04 01:43:41,919 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 8748 treesize of output 5835 [2023-05-04 01:43:43,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 01:43:43,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69384 treesize of output 68884 [2023-05-04 01:43:43,472 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 20950 treesize of output 19926 [2023-05-04 01:43:49,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 01:43:49,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 171875305816 treesize of output 171808179132 Received shutdown request... [2023-05-04 01:56:06,779 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 01:56:06,782 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 01:56:06,782 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 01:56:06,782 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 01:56:06,782 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 01:56:06,887 WARN L249 SmtUtils]: Removed 1 from assertion stack [2023-05-04 01:56:06,889 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-05-04 01:56:06,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-04 01:56:07,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 01:56:07,105 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 288 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-17-3-3-2-3-2-3-2-3-2-3-3-3-2-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-2-2-2-1 context. [2023-05-04 01:56:07,106 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 01:56:07,106 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2023-05-04 01:56:07,107 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 01:56:07,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 01:56:07,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 01:56:07 BasicIcfg [2023-05-04 01:56:07,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 01:56:07,110 INFO L158 Benchmark]: Toolchain (without parser) took 859691.32ms. Allocated memory was 158.3MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 133.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-05-04 01:56:07,111 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 158.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 01:56:07,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.81ms. Allocated memory was 158.3MB in the beginning and 209.7MB in the end (delta: 51.4MB). Free memory was 133.7MB in the beginning and 164.4MB in the end (delta: -30.7MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. [2023-05-04 01:56:07,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.93ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 161.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 01:56:07,111 INFO L158 Benchmark]: Boogie Preprocessor took 30.97ms. Allocated memory is still 209.7MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 01:56:07,111 INFO L158 Benchmark]: RCFGBuilder took 473.85ms. Allocated memory is still 209.7MB. Free memory was 158.6MB in the beginning and 136.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-05-04 01:56:07,111 INFO L158 Benchmark]: TraceAbstraction took 858684.50ms. Allocated memory was 209.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 135.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-05-04 01:56:07,112 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.47ms. Allocated memory is still 158.3MB. Free memory is still 118.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.81ms. Allocated memory was 158.3MB in the beginning and 209.7MB in the end (delta: 51.4MB). Free memory was 133.7MB in the beginning and 164.4MB in the end (delta: -30.7MB). Peak memory consumption was 23.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.93ms. Allocated memory is still 209.7MB. Free memory was 164.4MB in the beginning and 161.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.97ms. Allocated memory is still 209.7MB. Free memory was 161.2MB in the beginning and 159.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 473.85ms. Allocated memory is still 209.7MB. Free memory was 158.6MB in the beginning and 136.1MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 858684.50ms. Allocated memory was 209.7MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 135.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20211, independent: 18847, independent conditional: 4912, independent unconditional: 13935, dependent: 1364, dependent conditional: 1296, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18954, independent: 18847, independent conditional: 4912, independent unconditional: 13935, dependent: 107, dependent conditional: 39, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18954, independent: 18847, independent conditional: 4912, independent unconditional: 13935, dependent: 107, dependent conditional: 39, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19293, independent: 18847, independent conditional: 45, independent unconditional: 18802, dependent: 446, dependent conditional: 294, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19293, independent: 18847, independent conditional: 45, independent unconditional: 18802, dependent: 446, dependent conditional: 120, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19293, independent: 18847, independent conditional: 45, independent unconditional: 18802, dependent: 446, dependent conditional: 120, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11431, independent: 11335, independent conditional: 15, independent unconditional: 11320, dependent: 96, dependent conditional: 28, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11431, independent: 11315, independent conditional: 0, independent unconditional: 11315, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 116, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 96, dependent conditional: 28, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 96, dependent conditional: 28, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 72, independent conditional: 29, independent unconditional: 43, dependent: 165, dependent conditional: 46, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19293, independent: 7512, independent conditional: 30, independent unconditional: 7482, dependent: 350, dependent conditional: 92, dependent unconditional: 258, unknown: 11431, unknown conditional: 43, unknown unconditional: 11388] , Statistics on independence cache: Total cache size (in pairs): 11431, Positive cache size: 11335, Positive conditional cache size: 15, Positive unconditional cache size: 11320, Negative cache size: 96, Negative conditional cache size: 28, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 174, Maximal queried relation: 8, Independence queries for same thread: 1257 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1153, Number of trivial persistent sets: 708, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14003, independent: 13935, independent conditional: 0, independent unconditional: 13935, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20211, independent: 18847, independent conditional: 4912, independent unconditional: 13935, dependent: 1364, dependent conditional: 1296, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18954, independent: 18847, independent conditional: 4912, independent unconditional: 13935, dependent: 107, dependent conditional: 39, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18954, independent: 18847, independent conditional: 4912, independent unconditional: 13935, dependent: 107, dependent conditional: 39, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19293, independent: 18847, independent conditional: 45, independent unconditional: 18802, dependent: 446, dependent conditional: 294, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19293, independent: 18847, independent conditional: 45, independent unconditional: 18802, dependent: 446, dependent conditional: 120, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19293, independent: 18847, independent conditional: 45, independent unconditional: 18802, dependent: 446, dependent conditional: 120, dependent unconditional: 326, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11431, independent: 11335, independent conditional: 15, independent unconditional: 11320, dependent: 96, dependent conditional: 28, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11431, independent: 11315, independent conditional: 0, independent unconditional: 11315, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 116, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 96, dependent conditional: 28, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 20, independent conditional: 15, independent unconditional: 5, dependent: 96, dependent conditional: 28, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 237, independent: 72, independent conditional: 29, independent unconditional: 43, dependent: 165, dependent conditional: 46, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19293, independent: 7512, independent conditional: 30, independent unconditional: 7482, dependent: 350, dependent conditional: 92, dependent unconditional: 258, unknown: 11431, unknown conditional: 43, unknown unconditional: 11388] , Statistics on independence cache: Total cache size (in pairs): 11431, Positive cache size: 11335, Positive conditional cache size: 15, Positive unconditional cache size: 11320, Negative cache size: 96, Negative conditional cache size: 28, Negative unconditional cache size: 68, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 174, Maximal queried relation: 8, Independence queries for same thread: 1257 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9957, independent: 9550, independent conditional: 797, 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: 9665, independent: 9550, independent conditional: 797, 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: 9665, independent: 9550, independent conditional: 797, 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: 9685, independent: 9550, independent conditional: 0, independent unconditional: 9550, 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: 9685, independent: 9550, independent conditional: 0, independent unconditional: 9550, 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: 9685, independent: 9550, independent conditional: 0, independent unconditional: 9550, 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: 106, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9685, independent: 935, independent conditional: 0, independent unconditional: 935, 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.1s, 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: 9957, independent: 9550, independent conditional: 797, 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: 9665, independent: 9550, independent conditional: 797, 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: 9665, independent: 9550, independent conditional: 797, 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: 9685, independent: 9550, independent conditional: 0, independent unconditional: 9550, 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: 9685, independent: 9550, independent conditional: 0, independent unconditional: 9550, 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: 9685, independent: 9550, independent conditional: 0, independent unconditional: 9550, 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: 106, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 9685, independent: 935, independent conditional: 0, independent unconditional: 935, 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: 17352, independent: 16051, independent conditional: 4360, independent unconditional: 11691, dependent: 1301, dependent conditional: 1240, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 4360, independent unconditional: 11691, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 4360, independent unconditional: 11691, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 0, independent unconditional: 16051, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 0, independent unconditional: 16051, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 0, independent unconditional: 16051, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10658, independent: 10597, independent conditional: 0, independent unconditional: 10597, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10658, independent: 10591, independent conditional: 0, independent unconditional: 10591, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16112, independent: 5454, independent conditional: 0, independent unconditional: 5454, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10658, unknown conditional: 0, unknown unconditional: 10658] , Statistics on independence cache: Total cache size (in pairs): 10658, Positive cache size: 10597, Positive conditional cache size: 0, Positive unconditional cache size: 10597, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1240 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 451, Number of trivial persistent sets: 377, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11752, independent: 11691, independent conditional: 0, independent unconditional: 11691, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17352, independent: 16051, independent conditional: 4360, independent unconditional: 11691, dependent: 1301, dependent conditional: 1240, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 4360, independent unconditional: 11691, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 4360, independent unconditional: 11691, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 0, independent unconditional: 16051, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 0, independent unconditional: 16051, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16112, independent: 16051, independent conditional: 0, independent unconditional: 16051, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10658, independent: 10597, independent conditional: 0, independent unconditional: 10597, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10658, independent: 10591, independent conditional: 0, independent unconditional: 10591, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 16112, independent: 5454, independent conditional: 0, independent unconditional: 5454, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10658, unknown conditional: 0, unknown unconditional: 10658] , Statistics on independence cache: Total cache size (in pairs): 10658, Positive cache size: 10597, Positive conditional cache size: 0, Positive unconditional cache size: 10597, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 1240 - 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 - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 288 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-17-3-3-2-3-2-3-2-3-2-3-3-3-2-2-3-2-3-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-2-2-2-2-1 context. - 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: 18.8s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 8.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: 128, 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, 10.0s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1103 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1094 ConstructedInterpolants, 0 QuantifiedInterpolants, 12918 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: 839.4s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 10.7s, 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: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 1399 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1391 ConstructedInterpolants, 0 QuantifiedInterpolants, 18091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown