This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-16 08:42:13,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 08:42:14,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-16 08:42:14,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 08:42:14,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 08:42:14,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 08:42:14,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 08:42:14,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 08:42:14,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 08:42:14,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 08:42:14,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 08:42:14,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 08:42:14,072 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 08:42:14,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 08:42:14,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 08:42:14,074 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 08:42:14,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-16 08:42:14,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 08:42:14,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 08:42:14,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 08:42:14,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 08:42:14,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 08:42:14,078 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 08:42:14,078 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 08:42:14,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 08:42:14,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 08:42:14,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 08:42:14,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 08:42:14,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 08:42:14,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 08:42:14,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 08:42:14,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 08:42:14,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 08:42:14,079 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 08:42:14,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-16 08:42:14,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 08:42:14,080 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 08:42:14,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 08:42:14,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-16 08:42:14,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 08:42:14,080 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 08:42:14,081 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT [2024-10-16 08:42:14,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 08:42:14,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 08:42:14,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 08:42:14,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 08:42:14,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 08:42:14,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-10-16 08:42:15,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 08:42:15,890 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 08:42:15,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2024-10-16 08:42:15,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/dc6eeb8e5/b6b4418a43394d73b3cafbbf6852893c/FLAGacd9ddb59 [2024-10-16 08:42:15,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/dc6eeb8e5/b6b4418a43394d73b3cafbbf6852893c [2024-10-16 08:42:15,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 08:42:15,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 08:42:15,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 08:42:15,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 08:42:15,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 08:42:15,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 08:42:15" (1/1) ... [2024-10-16 08:42:15,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d0f894a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:15, skipping insertion in model container [2024-10-16 08:42:15,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 08:42:15" (1/1) ... [2024-10-16 08:42:15,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 08:42:16,352 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-10-16 08:42:16,359 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-10-16 08:42:16,362 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-10-16 08:42:16,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 08:42:16,377 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 08:42:16,419 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-10-16 08:42:16,423 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-10-16 08:42:16,424 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-10-16 08:42:16,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 08:42:16,488 INFO L204 MainTranslator]: Completed translation [2024-10-16 08:42:16,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16 WrapperNode [2024-10-16 08:42:16,489 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 08:42:16,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 08:42:16,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 08:42:16,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 08:42:16,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,554 INFO L138 Inliner]: procedures = 274, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-10-16 08:42:16,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 08:42:16,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 08:42:16,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 08:42:16,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 08:42:16,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 08:42:16,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 08:42:16,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 08:42:16,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 08:42:16,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (1/1) ... [2024-10-16 08:42:16,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 08:42:16,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 08:42:16,622 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-16 08:42:16,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-16 08:42:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-16 08:42:16,658 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-16 08:42:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-16 08:42:16,658 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-16 08:42:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-16 08:42:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-16 08:42:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-16 08:42:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-16 08:42:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 08:42:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-16 08:42:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 08:42:16,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 08:42:16,661 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-16 08:42:16,801 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 08:42:16,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 08:42:17,110 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 08:42:17,110 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 08:42:17,284 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 08:42:17,284 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-16 08:42:17,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 08:42:17 BoogieIcfgContainer [2024-10-16 08:42:17,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 08:42:17,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 08:42:17,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 08:42:17,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 08:42:17,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 08:42:15" (1/3) ... [2024-10-16 08:42:17,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6fb446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 08:42:17, skipping insertion in model container [2024-10-16 08:42:17,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:16" (2/3) ... [2024-10-16 08:42:17,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6fb446 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 08:42:17, skipping insertion in model container [2024-10-16 08:42:17,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 08:42:17" (3/3) ... [2024-10-16 08:42:17,292 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-10-16 08:42:17,305 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 08:42:17,305 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-16 08:42:17,305 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 08:42:17,344 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-16 08:42:17,373 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 08:42:17,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 08:42:17,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 08:42:17,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 08:42:17,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-16 08:42:17,445 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 08:42:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:17,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2024-10-16 08:42:17,463 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@855cdd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 08:42:17,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 08:42:18,476 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:18,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash -697811705, now seen corresponding path program 1 times [2024-10-16 08:42:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 08:42:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92451409] [2024-10-16 08:42:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:18,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 08:42:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 08:42:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92451409] [2024-10-16 08:42:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92451409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:18,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 08:42:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090541703] [2024-10-16 08:42:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:18,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-16 08:42:18,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 08:42:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-16 08:42:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-16 08:42:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:18,744 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:18,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2024-10-16 08:42:18,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:18,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-16 08:42:18,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:18,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:18,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1778644364, now seen corresponding path program 1 times [2024-10-16 08:42:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 08:42:18,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667601321] [2024-10-16 08:42:18,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:18,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 08:42:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:18,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 08:42:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667601321] [2024-10-16 08:42:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667601321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:18,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:18,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-16 08:42:18,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729184739] [2024-10-16 08:42:18,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:18,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 08:42:18,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 08:42:18,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 08:42:18,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 08:42:18,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:18,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:18,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-16 08:42:18,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:18,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:18,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-16 08:42:18,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:18,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:18,948 INFO L85 PathProgramCache]: Analyzing trace with hash -696597918, now seen corresponding path program 1 times [2024-10-16 08:42:18,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-16 08:42:18,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163639634] [2024-10-16 08:42:18,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:18,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 08:42:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:19,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-16 08:42:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163639634] [2024-10-16 08:42:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163639634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-16 08:42:19,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654817726] [2024-10-16 08:42:19,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:19,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 08:42:19,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-16 08:42:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 08:42:19,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 08:42:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:19,331 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:19,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-10-16 08:42:19,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:19,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:19,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:20,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-16 08:42:20,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-16 08:42:20,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:21,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 08:42:21,139 INFO L349 Elim1Store]: treesize reduction 96, result has 59.5 percent of original size [2024-10-16 08:42:21,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 202 treesize of output 219 [2024-10-16 08:42:21,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-16 08:42:21,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 208 [2024-10-16 08:42:21,173 INFO L378 Elim1Store]: Elim1 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 76 treesize of output 64 [2024-10-16 08:42:21,197 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2024-10-16 08:42:21,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 137 [2024-10-16 08:42:21,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-16 08:42:21,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 142 [2024-10-16 08:42:26,335 INFO L85 PathProgramCache]: Analyzing trace with hash 89511316, now seen corresponding path program 1 times [2024-10-16 08:42:26,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:26,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-16 08:42:26,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-16 08:42:26,367 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:88) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraigSleepSetPOR.construct(IpTcStrategyModuleCraigSleepSetPOR.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.PostConditionTraceChecker.checkTrace(PostConditionTraceChecker.java:110) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityChecker.checkConditionalCommutativity(ConditionalCommutativityChecker.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCounterexampleChecker.getInterpolants(ConditionalCommutativityCounterexampleChecker.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms at de.uni_freiburg.informatik.ultimate.logic.NoopScript.annotate(NoopScript.java:471) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.annotate(WrapperScript.java:282) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertTerm(AnnotateAndAssertCodeBlocks.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAssertCodeBlocks.annotateAndAssertNonCall(AnnotateAndAssertCodeBlocks.java:109) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:101) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 29 more [2024-10-16 08:42:26,371 INFO L158 Benchmark]: Toolchain (without parser) took 10442.81ms. Allocated memory was 81.8MB in the beginning and 243.3MB in the end (delta: 161.5MB). Free memory was 42.3MB in the beginning and 201.1MB in the end (delta: -158.8MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-16 08:42:26,372 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 108.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-16 08:42:26,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 560.10ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 42.3MB in the beginning and 87.9MB in the end (delta: -45.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-10-16 08:42:26,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.83ms. Allocated memory is still 113.2MB. Free memory was 87.9MB in the beginning and 84.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-16 08:42:26,375 INFO L158 Benchmark]: Boogie Preprocessor took 31.65ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-16 08:42:26,375 INFO L158 Benchmark]: RCFGBuilder took 697.24ms. Allocated memory is still 113.2MB. Free memory was 82.0MB in the beginning and 65.8MB in the end (delta: 16.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2024-10-16 08:42:26,376 INFO L158 Benchmark]: TraceAbstraction took 9083.82ms. Allocated memory was 113.2MB in the beginning and 243.3MB in the end (delta: 130.0MB). Free memory was 64.5MB in the beginning and 201.1MB in the end (delta: -136.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-16 08:42:26,377 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 61.8MB in the beginning and 61.7MB in the end (delta: 108.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 560.10ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 42.3MB in the beginning and 87.9MB in the end (delta: -45.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.83ms. Allocated memory is still 113.2MB. Free memory was 87.9MB in the beginning and 84.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.65ms. Allocated memory is still 113.2MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 697.24ms. Allocated memory is still 113.2MB. Free memory was 82.0MB in the beginning and 65.8MB in the end (delta: 16.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9083.82ms. Allocated memory was 113.2MB in the beginning and 243.3MB in the end (delta: 130.0MB). Free memory was 64.5MB in the beginning and 201.1MB in the end (delta: -136.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Cannot name open terms: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-16 08:42:26,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-16 08:42:26,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-16 08:42:28,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-16 08:42:28,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-16 08:42:28,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-16 08:42:28,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-16 08:42:28,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-16 08:42:28,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-16 08:42:28,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-16 08:42:28,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-16 08:42:28,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-16 08:42:28,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-16 08:42:28,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-16 08:42:28,579 INFO L153 SettingsManager]: * Use SBE=true [2024-10-16 08:42:28,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-16 08:42:28,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-16 08:42:28,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-16 08:42:28,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-16 08:42:28,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-16 08:42:28,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-16 08:42:28,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-16 08:42:28,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-16 08:42:28,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-16 08:42:28,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-16 08:42:28,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-16 08:42:28,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-16 08:42:28,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-16 08:42:28,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-16 08:42:28,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-16 08:42:28,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-16 08:42:28,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-16 08:42:28,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-16 08:42:28,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 08:42:28,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-16 08:42:28,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-16 08:42:28,588 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-16 08:42:28,588 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-16 08:42:28,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-16 08:42:28,588 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-16 08:42:28,588 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-16 08:42:28,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-16 08:42:28,589 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-16 08:42:28,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-16 08:42:28,590 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-16 08:42:28,590 INFO L153 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/UGemCutter-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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT [2024-10-16 08:42:28,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-16 08:42:28,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-16 08:42:28,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-16 08:42:28,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-16 08:42:28,865 INFO L274 PluginConnector]: CDTParser initialized [2024-10-16 08:42:28,866 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2024-10-16 08:42:30,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-16 08:42:30,516 INFO L384 CDTParser]: Found 1 translation units. [2024-10-16 08:42:30,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2024-10-16 08:42:30,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fa0d1e9d8/d528b6430dcd4c60a2a90121ead8fe18/FLAGb95ff4396 [2024-10-16 08:42:30,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fa0d1e9d8/d528b6430dcd4c60a2a90121ead8fe18 [2024-10-16 08:42:30,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-16 08:42:30,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-16 08:42:30,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-16 08:42:30,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-16 08:42:30,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-16 08:42:30,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 08:42:30" (1/1) ... [2024-10-16 08:42:30,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325496ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:30, skipping insertion in model container [2024-10-16 08:42:30,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 08:42:30" (1/1) ... [2024-10-16 08:42:30,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-16 08:42:31,311 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-10-16 08:42:31,317 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-10-16 08:42:31,320 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-10-16 08:42:31,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 08:42:31,337 INFO L200 MainTranslator]: Completed pre-run [2024-10-16 08:42:31,375 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2024-10-16 08:42:31,378 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2024-10-16 08:42:31,382 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2024-10-16 08:42:31,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-16 08:42:31,443 INFO L204 MainTranslator]: Completed translation [2024-10-16 08:42:31,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31 WrapperNode [2024-10-16 08:42:31,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-16 08:42:31,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-16 08:42:31,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-16 08:42:31,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-16 08:42:31,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,498 INFO L138 Inliner]: procedures = 278, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2024-10-16 08:42:31,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-16 08:42:31,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-16 08:42:31,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-16 08:42:31,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-16 08:42:31,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,539 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,545 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-16 08:42:31,553 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-16 08:42:31,553 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-16 08:42:31,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-16 08:42:31,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (1/1) ... [2024-10-16 08:42:31,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-16 08:42:31,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 08:42:31,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-16 08:42:31,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-16 08:42:31,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-16 08:42:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-16 08:42:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-16 08:42:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-16 08:42:31,636 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-16 08:42:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-16 08:42:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-16 08:42:31,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-16 08:42:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-16 08:42:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-16 08:42:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-16 08:42:31,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-16 08:42:31,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-16 08:42:31,639 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-16 08:42:31,786 INFO L238 CfgBuilder]: Building ICFG [2024-10-16 08:42:31,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-16 08:42:32,154 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-16 08:42:32,154 INFO L287 CfgBuilder]: Performing block encoding [2024-10-16 08:42:32,421 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-16 08:42:32,422 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-16 08:42:32,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 08:42:32 BoogieIcfgContainer [2024-10-16 08:42:32,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-16 08:42:32,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-16 08:42:32,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-16 08:42:32,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-16 08:42:32,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 08:42:30" (1/3) ... [2024-10-16 08:42:32,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ad81dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 08:42:32, skipping insertion in model container [2024-10-16 08:42:32,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 08:42:31" (2/3) ... [2024-10-16 08:42:32,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ad81dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 08:42:32, skipping insertion in model container [2024-10-16 08:42:32,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 08:42:32" (3/3) ... [2024-10-16 08:42:32,431 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2024-10-16 08:42:32,446 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-16 08:42:32,447 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-16 08:42:32,447 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-16 08:42:32,492 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-16 08:42:32,523 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 08:42:32,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 08:42:32,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 08:42:32,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 08:42:32,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-16 08:42:32,600 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 08:42:32,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:32,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2024-10-16 08:42:32,647 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@89cd786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 08:42:32,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 08:42:36,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:36,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:36,399 INFO L85 PathProgramCache]: Analyzing trace with hash 513534230, now seen corresponding path program 1 times [2024-10-16 08:42:36,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:36,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376349761] [2024-10-16 08:42:36,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:36,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:36,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:36,434 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:36,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-16 08:42:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:36,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-16 08:42:36,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:36,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:36,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:36,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376349761] [2024-10-16 08:42:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1376349761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:36,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:36,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 08:42:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857234644] [2024-10-16 08:42:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:36,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-16 08:42:36,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-16 08:42:36,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-16 08:42:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:36,575 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:36,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2024-10-16 08:42:36,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:36,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-16 08:42:36,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:36,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:36,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:36,815 INFO L85 PathProgramCache]: Analyzing trace with hash -376639806, now seen corresponding path program 1 times [2024-10-16 08:42:36,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414338026] [2024-10-16 08:42:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:36,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:36,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:36,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:36,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-16 08:42:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:36,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-16 08:42:36,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:36,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:36,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414338026] [2024-10-16 08:42:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414338026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:36,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:36,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-16 08:42:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135147790] [2024-10-16 08:42:36,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:36,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 08:42:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 08:42:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 08:42:36,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:36,934 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:36,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-16 08:42:36,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:36,935 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:36,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-16 08:42:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:37,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:37,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1209069536, now seen corresponding path program 1 times [2024-10-16 08:42:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:37,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912018481] [2024-10-16 08:42:37,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:37,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:37,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:37,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:37,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-16 08:42:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:37,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-16 08:42:37,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:37,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2024-10-16 08:42:37,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 183 [2024-10-16 08:42:37,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2024-10-16 08:42:37,458 INFO L378 Elim1Store]: Elim1 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 71 treesize of output 59 [2024-10-16 08:42:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:37,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:37,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:37,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912018481] [2024-10-16 08:42:37,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912018481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:37,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:37,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-16 08:42:37,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990868947] [2024-10-16 08:42:37,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:37,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-16 08:42:37,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:37,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-16 08:42:37,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-16 08:42:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:37,471 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:37,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2024-10-16 08:42:37,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:37,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:37,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:40,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-16 08:42:40,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-16 08:42:40,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:40,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:42,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:42,665 INFO L85 PathProgramCache]: Analyzing trace with hash -466661440, now seen corresponding path program 1 times [2024-10-16 08:42:42,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:42,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433400719] [2024-10-16 08:42:42,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:42,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:42,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:42,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:42,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-16 08:42:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:42,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-16 08:42:42,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:42,758 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 9 [2024-10-16 08:42:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:42,772 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:42,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433400719] [2024-10-16 08:42:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433400719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-16 08:42:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052335617] [2024-10-16 08:42:42,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:42,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 08:42:42,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:42,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 08:42:42,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 08:42:42,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:42,775 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:42,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-10-16 08:42:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-16 08:42:42,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:45,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-16 08:42:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:45,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-16 08:42:45,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:45,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1909333931, now seen corresponding path program 1 times [2024-10-16 08:42:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935635661] [2024-10-16 08:42:45,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:45,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:45,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:45,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:45,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-16 08:42:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:45,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-16 08:42:45,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:45,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:45,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:45,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:45,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935635661] [2024-10-16 08:42:45,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935635661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:45,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:45,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 08:42:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959241252] [2024-10-16 08:42:46,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:46,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 08:42:46,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 08:42:46,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 08:42:46,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:46,001 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:46,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 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) [2024-10-16 08:42:46,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:46,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:46,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-16 08:42:46,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:46,001 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-16 08:42:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:46,034 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-16 08:42:46,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-16 08:42:46,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:46,240 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-16 08:42:46,241 INFO L312 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2024-10-16 08:42:46,244 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 08:42:46,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 08:42:46,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 08:42:46,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 08:42:46,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-10-16 08:42:46,286 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 08:42:46,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:46,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-16 08:42:46,287 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@89cd786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 08:42:46,288 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-16 08:42:46,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-16 08:42:46,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 625383, now seen corresponding path program 1 times [2024-10-16 08:42:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:46,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232490258] [2024-10-16 08:42:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:46,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:46,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-16 08:42:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:46,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-16 08:42:46,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:46,347 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:46,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:46,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232490258] [2024-10-16 08:42:46,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232490258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:46,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:46,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 08:42:46,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771258665] [2024-10-16 08:42:46,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:46,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-16 08:42:46,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:46,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-16 08:42:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-16 08:42:46,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:46,348 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:46,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-16 08:42:46,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:49,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-16 08:42:49,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-16 08:42:49,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-16 08:42:49,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-16 08:42:49,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:49,725 INFO L414 BasicCegarLoop]: Path program histogram: [1] [2024-10-16 08:42:49,725 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (2/3) [2024-10-16 08:42:49,727 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-16 08:42:49,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-16 08:42:49,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-16 08:42:49,729 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-16 08:42:49,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-16 08:42:49,770 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-16 08:42:49,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:49,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2024-10-16 08:42:49,770 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@89cd786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-16 08:42:49,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-16 08:42:52,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:52,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:52,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1764288327, now seen corresponding path program 1 times [2024-10-16 08:42:52,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:52,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460614214] [2024-10-16 08:42:52,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:52,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:52,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:52,824 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:52,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-16 08:42:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:52,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-16 08:42:52,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:52,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:52,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:52,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460614214] [2024-10-16 08:42:52,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460614214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:52,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:52,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-16 08:42:52,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991814441] [2024-10-16 08:42:52,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:52,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-16 08:42:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:52,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-16 08:42:52,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-16 08:42:52,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:52,922 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:52,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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) [2024-10-16 08:42:52,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:52,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-16 08:42:53,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:53,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1448216731, now seen corresponding path program 1 times [2024-10-16 08:42:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011673781] [2024-10-16 08:42:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:53,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:53,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:53,154 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:53,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-16 08:42:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:53,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-16 08:42:53,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:53,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:53,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011673781] [2024-10-16 08:42:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011673781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:53,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-16 08:42:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892157482] [2024-10-16 08:42:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 08:42:53,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 08:42:53,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 08:42:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:53,248 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2024-10-16 08:42:53,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:53,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:53,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-16 08:42:53,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:53,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:42:53,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:42:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash 179415811, now seen corresponding path program 1 times [2024-10-16 08:42:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:42:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353220654] [2024-10-16 08:42:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:42:53,496 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:42:53,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:42:53,498 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:42:53,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-16 08:42:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:42:53,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-16 08:42:53,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:42:53,577 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 9 [2024-10-16 08:42:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:42:53,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:42:53,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:42:53,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353220654] [2024-10-16 08:42:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353220654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:42:53,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:42:53,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-16 08:42:53,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525939583] [2024-10-16 08:42:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:42:53,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-16 08:42:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:42:53,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-16 08:42:53,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-16 08:42:53,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:53,597 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:42:53,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2024-10-16 08:42:53,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:42:53,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:42:53,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:08,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:08,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-16 08:43:08,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:43:08,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:43:08,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:43:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash 650719378, now seen corresponding path program 1 times [2024-10-16 08:43:08,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:43:08,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335596802] [2024-10-16 08:43:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:43:08,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:43:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:43:08,725 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:43:08,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-16 08:43:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:43:08,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-16 08:43:08,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:43:08,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-10-16 08:43:09,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 133 [2024-10-16 08:43:09,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2024-10-16 08:43:09,081 INFO L378 Elim1Store]: Elim1 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 34 treesize of output 32 [2024-10-16 08:43:09,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-10-16 08:43:09,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 102 [2024-10-16 08:43:09,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 68 treesize of output 63 [2024-10-16 08:43:09,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 41 [2024-10-16 08:43:09,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 99 [2024-10-16 08:43:09,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2024-10-16 08:43:09,781 INFO L378 Elim1Store]: Elim1 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 [2024-10-16 08:43:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:43:09,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:43:09,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:43:09,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335596802] [2024-10-16 08:43:09,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335596802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:43:09,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:43:09,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-16 08:43:09,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088657510] [2024-10-16 08:43:09,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:43:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-16 08:43:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:43:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-16 08:43:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-16 08:43:09,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:09,798 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:43:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-10-16 08:43:09,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:09,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:09,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:09,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:10,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-16 08:43:10,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-16 08:43:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:43:10,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:43:10,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:43:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -144566206, now seen corresponding path program 1 times [2024-10-16 08:43:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:43:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500168284] [2024-10-16 08:43:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:43:10,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:43:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:43:10,457 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:43:10,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-16 08:43:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:43:10,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-16 08:43:10,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:43:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:43:10,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-16 08:43:10,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:43:10,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500168284] [2024-10-16 08:43:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500168284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-16 08:43:10,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-16 08:43:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-16 08:43:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035034509] [2024-10-16 08:43:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-16 08:43:10,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-16 08:43:10,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-16 08:43:10,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-16 08:43:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-16 08:43:10,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:10,624 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-16 08:43:10,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 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) [2024-10-16 08:43:10,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:10,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:10,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:10,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-16 08:43:10,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-16 08:43:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-16 08:43:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-16 08:43:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-16 08:43:11,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-16 08:43:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:43:11,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-16 08:43:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-16 08:43:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1976775427, now seen corresponding path program 1 times [2024-10-16 08:43:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-16 08:43:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990434549] [2024-10-16 08:43:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-16 08:43:11,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:43:11,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-16 08:43:11,579 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-16 08:43:11,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-16 08:43:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-16 08:43:11,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-16 08:43:11,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-16 08:43:11,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-10-16 08:43:12,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 133 [2024-10-16 08:43:12,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-10-16 08:43:12,105 INFO L378 Elim1Store]: Elim1 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 24 [2024-10-16 08:43:12,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 114 [2024-10-16 08:43:12,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-16 08:43:12,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2024-10-16 08:43:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 105 [2024-10-16 08:43:12,757 INFO L378 Elim1Store]: Elim1 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 74 treesize of output 58 [2024-10-16 08:43:13,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 118 [2024-10-16 08:43:13,251 INFO L378 Elim1Store]: Elim1 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 60 treesize of output 48 [2024-10-16 08:43:13,254 INFO L378 Elim1Store]: Elim1 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 60 treesize of output 50 [2024-10-16 08:43:13,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 55 treesize of output 48 [2024-10-16 08:43:13,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 104 [2024-10-16 08:43:13,487 INFO L378 Elim1Store]: Elim1 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 11 [2024-10-16 08:43:13,488 INFO L378 Elim1Store]: Elim1 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 [2024-10-16 08:43:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-16 08:43:13,513 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-16 08:43:33,630 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 8) c_~enqueue_flag~0)) (.cse2 (bvadd (bvmul |c_t2Thread1of1ForFork0_~i~1#1| (_ bv4 32)) |c_~#stored_elements~0.offset|)) (.cse6 (bvadd (_ bv1600 32) |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (or (not .cse0) (let ((.cse5 (select .cse4 .cse6))) (let ((.cse1 (= (_ bv400 32) .cse5))) (and (or (not .cse1) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2))))) (or (let ((.cse3 (= (_ bv0 32) (select .cse4 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse5)))))) (and (or .cse3 (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2))))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (not .cse3)))) .cse1))))) (or .cse0 (let ((.cse12 (bvadd (_ bv1604 32) |c_~#queue~0.offset|))) (let ((.cse48 (select .cse4 .cse12)) (.cse26 (bvadd (_ bv1608 32) |c_~#queue~0.offset|))) (let ((.cse27 (bvadd (_ bv1 32) (select .cse4 .cse26))) (.cse92 (bvmul (_ bv4 32) |c_t1Thread1of1ForFork1_~i~0#1|)) (.cse93 (bvmul (_ bv4 32) .cse48))) (let ((.cse25 (bvadd |c_~#queue~0.offset| .cse93)) (.cse47 (= (_ bv1608 32) .cse93)) (.cse22 (= |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse32 (bvadd .cse92 |c_~#stored_elements~0.offset|)) (.cse7 (= (_ bv1604 32) .cse93)) (.cse10 (bvadd (_ bv4 32) .cse92 |c_~#stored_elements~0.offset|)) (.cse11 (store .cse4 .cse26 .cse27))) (and (or .cse7 (let ((.cse21 (= .cse25 .cse10))) (and (or (and (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| (store .cse11 .cse12 v_DerPreprocessor_47)))) (let ((.cse9 (store (select .cse8 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_48))) (or (not (= (select (select (store .cse8 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|) .cse6) (_ bv400 32))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))))))) (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse16 (store |c_#memory_int| |c_~#queue~0.base| (store .cse11 .cse12 v_DerPreprocessor_47)))) (let ((.cse15 (store (select .cse16 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_48))) (let ((.cse13 (select (store .cse16 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|))) (let ((.cse14 (select .cse13 .cse6))) (or (not (= (_ bv0 32) (select .cse13 (bvadd |c_~#queue~0.offset| (bvmul .cse14 (_ bv4 32)))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_prenex_12) |c_~#stored_elements~0.base|) .cse2)))) (= .cse14 (_ bv400 32)))))))) (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store .cse11 .cse12 v_DerPreprocessor_47)))) (let ((.cse18 (store (select .cse20 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_48))) (let ((.cse19 (select (store .cse20 |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base|))) (let ((.cse17 (select .cse19 .cse6))) (or (= .cse17 (_ bv400 32)) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse18) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= (_ bv0 32) (select .cse19 (bvadd |c_~#queue~0.offset| (bvmul .cse17 (_ bv4 32)))))))))))) (not .cse21) (not .cse22)) (or (and (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse23 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse25 v_DerPreprocessor_49) .cse26 .cse27)))) (let ((.cse24 (store (select .cse23 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_50))) (or (not (= (_ bv400 32) (select (select (store .cse23 |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base|) .cse6))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse24) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2)))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse31 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse25 v_DerPreprocessor_49) .cse26 .cse27)))) (let ((.cse28 (store (select .cse31 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_50))) (let ((.cse30 (select (store .cse31 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|))) (let ((.cse29 (select .cse30 .cse6))) (or (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| v_prenex_14) |c_~#stored_elements~0.base|) .cse2)))) (= (_ bv400 32) .cse29) (not (= (_ bv0 32) (select .cse30 (bvadd (bvmul (_ bv4 32) .cse29) |c_~#queue~0.offset|)))))))))) (or (and (= .cse32 .cse6) .cse22) (and (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse36 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse4 .cse25 v_DerPreprocessor_51) .cse26 .cse27) .cse12 v_DerPreprocessor_52)))) (let ((.cse33 (store (select .cse36 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_53))) (let ((.cse34 (select (store .cse36 |c_~#stored_elements~0.base| .cse33) |c_~#queue~0.base|))) (let ((.cse35 (select .cse34 .cse6))) (or (forall ((v_prenex_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse33) |c_~#queue~0.base| v_prenex_15) |c_~#stored_elements~0.base|) .cse2)))) (not (= (select .cse34 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse35))) (_ bv0 32))) (= (_ bv400 32) .cse35))))))) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse37 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse4 .cse25 v_DerPreprocessor_51) .cse26 .cse27) .cse12 v_DerPreprocessor_52)))) (let ((.cse38 (store (select .cse37 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_53))) (or (not (= (_ bv400 32) (select (select (store .cse37 |c_~#stored_elements~0.base| .cse38) |c_~#queue~0.base|) .cse6))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse38) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2)))))))) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse42 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse4 .cse25 v_DerPreprocessor_51) .cse26 .cse27) .cse12 v_DerPreprocessor_52)))) (let ((.cse39 (store (select .cse42 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_53))) (let ((.cse40 (select (store .cse42 |c_~#stored_elements~0.base| .cse39) |c_~#queue~0.base|))) (let ((.cse41 (select .cse40 .cse6))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse39) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= (select .cse40 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse41))) (_ bv0 32)) (= (_ bv400 32) .cse41))))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse46 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse25 v_DerPreprocessor_49) .cse26 .cse27)))) (let ((.cse45 (store (select .cse46 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_50))) (let ((.cse43 (select (store .cse46 |c_~#stored_elements~0.base| .cse45) |c_~#queue~0.base|))) (let ((.cse44 (select .cse43 .cse6))) (or (= (_ bv0 32) (select .cse43 (bvadd (bvmul (_ bv4 32) .cse44) |c_~#queue~0.offset|))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse45) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= (_ bv400 32) .cse44)))))))) (and .cse21 .cse22)))) .cse47 (= (_ bv400 32) .cse48)) (or (forall ((v_ArrVal_377 (_ BitVec 32))) (not (= (_ bv400 32) (select (store .cse4 .cse25 v_ArrVal_377) .cse12)))) (and (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32))) (let ((.cse52 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse50 (store (select .cse52 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_46))) (let ((.cse51 (select (store .cse52 |c_~#stored_elements~0.base| .cse50) |c_~#queue~0.base|))) (let ((.cse49 (select .cse51 .cse6))) (or (= .cse49 (_ bv400 32)) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse50) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= (_ bv0 32) (select .cse51 (bvadd |c_~#queue~0.offset| (bvmul .cse49 (_ bv4 32))))))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse54 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse53 (store (select .cse54 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_46))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse53) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2))) (not (= (select (select (store .cse54 |c_~#stored_elements~0.base| .cse53) |c_~#queue~0.base|) .cse6) (_ bv400 32))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32))) (let ((.cse58 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse55 (store (select .cse58 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_46))) (let ((.cse57 (select (store .cse58 |c_~#stored_elements~0.base| .cse55) |c_~#queue~0.base|))) (let ((.cse56 (select .cse57 .cse6))) (or (forall ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse55) |c_~#queue~0.base| v_prenex_10) |c_~#stored_elements~0.base|) .cse2)))) (= .cse56 (_ bv400 32)) (not (= (_ bv0 32) (select .cse57 (bvadd |c_~#queue~0.offset| (bvmul .cse56 (_ bv4 32)))))))))))))) (or (not .cse47) (let ((.cse59 (= .cse12 .cse32))) (and (or (not .cse59) (and (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse63 (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse12 v_DerPreprocessor_41)))) (let ((.cse61 (store (select .cse63 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_42))) (let ((.cse62 (select (store .cse63 |c_~#stored_elements~0.base| .cse61) |c_~#queue~0.base|))) (let ((.cse60 (select .cse62 .cse6))) (or (= (_ bv400 32) .cse60) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse61) |c_~#queue~0.base| v_prenex_8) |c_~#stored_elements~0.base|) .cse2)))) (not (= (_ bv0 32) (select .cse62 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse60))))))))))) (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse64 (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse12 v_DerPreprocessor_41)))) (let ((.cse65 (store (select .cse64 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_42))) (or (not (= (_ bv400 32) (select (select (store .cse64 |c_~#stored_elements~0.base| .cse65) |c_~#queue~0.base|) .cse6))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse65) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2)))))))) (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse69 (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse12 v_DerPreprocessor_41)))) (let ((.cse68 (store (select .cse69 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_42))) (let ((.cse66 (select (store .cse69 |c_~#stored_elements~0.base| .cse68) |c_~#queue~0.base|))) (let ((.cse67 (select .cse66 .cse6))) (or (= (_ bv0 32) (select .cse66 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse67)))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse68) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))) (= (_ bv400 32) .cse67))))))))) (or (and (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse73 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse26 v_DerPreprocessor_43) .cse12 v_DerPreprocessor_44)))) (let ((.cse70 (store (select .cse73 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_45))) (let ((.cse71 (select (store .cse73 |c_~#stored_elements~0.base| .cse70) |c_~#queue~0.base|))) (let ((.cse72 (select .cse71 .cse6))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse70) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= (_ bv0 32) (select .cse71 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse72)))) (not (= v_DerPreprocessor_44 (select .cse71 .cse12))) (= (_ bv400 32) .cse72))))))) (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse77 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse26 v_DerPreprocessor_43) .cse12 v_DerPreprocessor_44)))) (let ((.cse74 (store (select .cse77 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_45))) (let ((.cse75 (select (store .cse77 |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base|))) (let ((.cse76 (select .cse75 .cse6))) (or (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base| v_prenex_9) |c_~#stored_elements~0.base|) .cse2)))) (not (= v_DerPreprocessor_44 (select .cse75 .cse12))) (not (= (_ bv0 32) (select .cse75 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse76))))) (= (_ bv400 32) .cse76))))))) (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse80 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse26 v_DerPreprocessor_43) .cse12 v_DerPreprocessor_44)))) (let ((.cse78 (store (select .cse80 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_45))) (let ((.cse79 (select (store .cse80 |c_~#stored_elements~0.base| .cse78) |c_~#queue~0.base|))) (or (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse78) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2)))) (not (= (_ bv400 32) (select .cse79 .cse6))) (not (= v_DerPreprocessor_44 (select .cse79 .cse12))))))))) (and .cse59 .cse22))))) (or (not .cse7) (and (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse83 (store |c_#memory_int| |c_~#queue~0.base| (store .cse11 .cse12 v_DerPreprocessor_39)))) (let ((.cse82 (store (select .cse83 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_40))) (let ((.cse81 (select (store .cse83 |c_~#stored_elements~0.base| .cse82) |c_~#queue~0.base|))) (or (not (= (_ bv400 32) (select .cse81 .cse6))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse82) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))) (not (= (select .cse81 .cse12) v_DerPreprocessor_39))))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse87 (store |c_#memory_int| |c_~#queue~0.base| (store .cse11 .cse12 v_DerPreprocessor_39)))) (let ((.cse85 (store (select .cse87 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_40))) (let ((.cse86 (select (store .cse87 |c_~#stored_elements~0.base| .cse85) |c_~#queue~0.base|))) (let ((.cse84 (select .cse86 .cse6))) (or (= (_ bv400 32) .cse84) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse85) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (not (= (select .cse86 .cse12) v_DerPreprocessor_39)) (= (select .cse86 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse84))) (_ bv0 32)))))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse91 (store |c_#memory_int| |c_~#queue~0.base| (store .cse11 .cse12 v_DerPreprocessor_39)))) (let ((.cse89 (store (select .cse91 |c_~#stored_elements~0.base|) .cse10 v_DerPreprocessor_40))) (let ((.cse90 (select (store .cse91 |c_~#stored_elements~0.base| .cse89) |c_~#queue~0.base|))) (let ((.cse88 (select .cse90 .cse6))) (or (= (_ bv400 32) .cse88) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse89) |c_~#queue~0.base| v_prenex_6) |c_~#stored_elements~0.base|) .cse2)))) (not (= (select .cse90 .cse12) v_DerPreprocessor_39)) (not (= (select .cse90 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse88))) (_ bv0 32))))))))))))))))))) is different from true [2024-10-16 08:44:25,269 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 8) c_~enqueue_flag~0)) (.cse2 (bvadd (_ bv4 32) (bvmul |c_t2Thread1of1ForFork0_~i~1#1| (_ bv4 32)) |c_~#stored_elements~0.offset|)) (.cse6 (bvadd (_ bv1600 32) |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (and (or (not .cse0) (let ((.cse4 (select .cse3 .cse6))) (let ((.cse5 (= (_ bv400 32) .cse4))) (and (or (let ((.cse1 (= (_ bv0 32) (select .cse3 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse4)))))) (and (or (not .cse1) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2) (_ bv1 32))))) (or .cse1 (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32))))))) .cse5) (or (not .cse5) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2))))))))) (or .cse0 (let ((.cse8 (bvadd (_ bv1604 32) |c_~#queue~0.offset|))) (let ((.cse58 (select .cse3 .cse8)) (.cse38 (bvadd (_ bv1608 32) |c_~#queue~0.offset|))) (let ((.cse39 (bvadd (_ bv1 32) (select .cse3 .cse38))) (.cse92 (bvmul (_ bv4 32) |c_t1Thread1of1ForFork1_~i~0#1|)) (.cse93 (bvmul (_ bv4 32) .cse58))) (let ((.cse7 (bvadd |c_~#queue~0.offset| .cse93)) (.cse57 (= (_ bv1608 32) .cse93)) (.cse33 (= |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse56 (bvadd .cse92 |c_~#stored_elements~0.offset|)) (.cse20 (= (_ bv1604 32) .cse93)) (.cse13 (bvadd (_ bv4 32) .cse92 |c_~#stored_elements~0.offset|)) (.cse25 (store .cse3 .cse38 .cse39))) (and (or (forall ((v_ArrVal_377 (_ BitVec 32))) (not (= (_ bv400 32) (select (store .cse3 .cse7 v_ArrVal_377) .cse8)))) (and (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse9 (store (select .cse12 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_46))) (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse10 (select .cse11 .cse6))) (or (forall ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| v_prenex_10) |c_~#stored_elements~0.base|) .cse2) (_ bv1 32)))) (= .cse10 (_ bv400 32)) (not (= (_ bv0 32) (select .cse11 (bvadd |c_~#queue~0.offset| (bvmul .cse10 (_ bv4 32)))))))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32))) (let ((.cse17 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse14 (store (select .cse17 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_46))) (let ((.cse16 (select (store .cse17 |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base|))) (let ((.cse15 (select .cse16 .cse6))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse14) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= .cse15 (_ bv400 32)) (= (_ bv0 32) (select .cse16 (bvadd |c_~#queue~0.offset| (bvmul .cse15 (_ bv4 32))))))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse19 (store (select .cse18 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_46))) (or (not (= (select (select (store .cse18 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|) .cse6) (_ bv400 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2))))))))) (or .cse20 (let ((.cse32 (= .cse7 .cse13))) (and (or (and (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse24 (store |c_#memory_int| |c_~#queue~0.base| (store .cse25 .cse8 v_DerPreprocessor_47)))) (let ((.cse23 (store (select .cse24 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_48))) (let ((.cse21 (select (store .cse24 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|))) (let ((.cse22 (select .cse21 .cse6))) (or (not (= (_ bv0 32) (select .cse21 (bvadd |c_~#queue~0.offset| (bvmul .cse22 (_ bv4 32)))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_prenex_12) |c_~#stored_elements~0.base|) .cse2)))) (= .cse22 (_ bv400 32)))))))) (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse26 (store |c_#memory_int| |c_~#queue~0.base| (store .cse25 .cse8 v_DerPreprocessor_47)))) (let ((.cse27 (store (select .cse26 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_48))) (or (not (= (select (select (store .cse26 |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base|) .cse6) (_ bv400 32))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse27) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))))))) (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse31 (store |c_#memory_int| |c_~#queue~0.base| (store .cse25 .cse8 v_DerPreprocessor_47)))) (let ((.cse30 (store (select .cse31 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_48))) (let ((.cse29 (select (store .cse31 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse28 (select .cse29 .cse6))) (or (= .cse28 (_ bv400 32)) (= (_ bv0 32) (select .cse29 (bvadd |c_~#queue~0.offset| (bvmul .cse28 (_ bv4 32))))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32))))))))))) (not .cse32) (not .cse33)) (or (and (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse37 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse7 v_DerPreprocessor_49) .cse38 .cse39)))) (let ((.cse34 (store (select .cse37 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_50))) (let ((.cse36 (select (store .cse37 |c_~#stored_elements~0.base| .cse34) |c_~#queue~0.base|))) (let ((.cse35 (select .cse36 .cse6))) (or (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse34) |c_~#queue~0.base| v_prenex_14) |c_~#stored_elements~0.base|) .cse2) (_ bv1 32)))) (= (_ bv400 32) .cse35) (not (= (_ bv0 32) (select .cse36 (bvadd (bvmul (_ bv4 32) .cse35) |c_~#queue~0.offset|)))))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse43 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse7 v_DerPreprocessor_49) .cse38 .cse39)))) (let ((.cse42 (store (select .cse43 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_50))) (let ((.cse40 (select (store .cse43 |c_~#stored_elements~0.base| .cse42) |c_~#queue~0.base|))) (let ((.cse41 (select .cse40 .cse6))) (or (= (_ bv0 32) (select .cse40 (bvadd (bvmul (_ bv4 32) .cse41) |c_~#queue~0.offset|))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse42) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))) (= (_ bv400 32) .cse41))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse45 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse7 v_DerPreprocessor_49) .cse38 .cse39)))) (let ((.cse44 (store (select .cse45 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_50))) (or (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse44) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2)))) (not (= (_ bv400 32) (select (select (store .cse45 |c_~#stored_elements~0.base| .cse44) |c_~#queue~0.base|) .cse6))))))) (or (and (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse49 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse3 .cse7 v_DerPreprocessor_51) .cse38 .cse39) .cse8 v_DerPreprocessor_52)))) (let ((.cse46 (store (select .cse49 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_53))) (let ((.cse47 (select (store .cse49 |c_~#stored_elements~0.base| .cse46) |c_~#queue~0.base|))) (let ((.cse48 (select .cse47 .cse6))) (or (forall ((v_prenex_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse46) |c_~#queue~0.base| v_prenex_15) |c_~#stored_elements~0.base|) .cse2)))) (not (= (select .cse47 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse48))) (_ bv0 32))) (= (_ bv400 32) .cse48))))))) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse51 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse3 .cse7 v_DerPreprocessor_51) .cse38 .cse39) .cse8 v_DerPreprocessor_52)))) (let ((.cse50 (store (select .cse51 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_53))) (or (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse50) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2)))) (not (= (_ bv400 32) (select (select (store .cse51 |c_~#stored_elements~0.base| .cse50) |c_~#queue~0.base|) .cse6))))))) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse55 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse3 .cse7 v_DerPreprocessor_51) .cse38 .cse39) .cse8 v_DerPreprocessor_52)))) (let ((.cse52 (store (select .cse55 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_53))) (let ((.cse53 (select (store .cse55 |c_~#stored_elements~0.base| .cse52) |c_~#queue~0.base|))) (let ((.cse54 (select .cse53 .cse6))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse52) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= (select .cse53 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse54))) (_ bv0 32)) (= (_ bv400 32) .cse54)))))))) (and (= .cse56 .cse6) .cse33))) (and .cse32 .cse33)))) .cse57 (= (_ bv400 32) .cse58)) (or (not .cse57) (let ((.cse70 (= .cse8 .cse56))) (and (or (and (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse62 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse38 v_DerPreprocessor_43) .cse8 v_DerPreprocessor_44)))) (let ((.cse59 (store (select .cse62 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_45))) (let ((.cse60 (select (store .cse62 |c_~#stored_elements~0.base| .cse59) |c_~#queue~0.base|))) (let ((.cse61 (select .cse60 .cse6))) (or (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse59) |c_~#queue~0.base| v_prenex_9) |c_~#stored_elements~0.base|) .cse2)))) (not (= v_DerPreprocessor_44 (select .cse60 .cse8))) (not (= (_ bv0 32) (select .cse60 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse61))))) (= (_ bv400 32) .cse61))))))) (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse65 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse38 v_DerPreprocessor_43) .cse8 v_DerPreprocessor_44)))) (let ((.cse64 (store (select .cse65 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_45))) (let ((.cse63 (select (store .cse65 |c_~#stored_elements~0.base| .cse64) |c_~#queue~0.base|))) (or (not (= (_ bv400 32) (select .cse63 .cse6))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse64) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))) (not (= v_DerPreprocessor_44 (select .cse63 .cse8)))))))) (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse69 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse3 .cse38 v_DerPreprocessor_43) .cse8 v_DerPreprocessor_44)))) (let ((.cse68 (store (select .cse69 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_45))) (let ((.cse66 (select (store .cse69 |c_~#stored_elements~0.base| .cse68) |c_~#queue~0.base|))) (let ((.cse67 (select .cse66 .cse6))) (or (= (_ bv0 32) (select .cse66 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse67)))) (not (= v_DerPreprocessor_44 (select .cse66 .cse8))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse68) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2)))) (= (_ bv400 32) .cse67)))))))) (and .cse70 .cse33)) (or (not .cse70) (and (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse74 (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse8 v_DerPreprocessor_41)))) (let ((.cse71 (store (select .cse74 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_42))) (let ((.cse72 (select (store .cse74 |c_~#stored_elements~0.base| .cse71) |c_~#queue~0.base|))) (let ((.cse73 (select .cse72 .cse6))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse71) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))) (= (_ bv0 32) (select .cse72 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse73)))) (= (_ bv400 32) .cse73))))))) (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse78 (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse8 v_DerPreprocessor_41)))) (let ((.cse76 (store (select .cse78 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_42))) (let ((.cse77 (select (store .cse78 |c_~#stored_elements~0.base| .cse76) |c_~#queue~0.base|))) (let ((.cse75 (select .cse77 .cse6))) (or (= (_ bv400 32) .cse75) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse76) |c_~#queue~0.base| v_prenex_8) |c_~#stored_elements~0.base|) .cse2)))) (not (= (_ bv0 32) (select .cse77 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse75))))))))))) (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse80 (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse8 v_DerPreprocessor_41)))) (let ((.cse79 (store (select .cse80 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_42))) (or (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse79) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2)))) (not (= (_ bv400 32) (select (select (store .cse80 |c_~#stored_elements~0.base| .cse79) |c_~#queue~0.base|) .cse6)))))))))))) (or (not .cse20) (and (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse83 (store |c_#memory_int| |c_~#queue~0.base| (store .cse25 .cse8 v_DerPreprocessor_39)))) (let ((.cse82 (store (select .cse83 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_40))) (let ((.cse81 (select (store .cse83 |c_~#stored_elements~0.base| .cse82) |c_~#queue~0.base|))) (or (not (= (_ bv400 32) (select .cse81 .cse6))) (not (= (select .cse81 .cse8) v_DerPreprocessor_39)) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse82) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse2))))))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse87 (store |c_#memory_int| |c_~#queue~0.base| (store .cse25 .cse8 v_DerPreprocessor_39)))) (let ((.cse84 (store (select .cse87 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_40))) (let ((.cse86 (select (store .cse87 |c_~#stored_elements~0.base| .cse84) |c_~#queue~0.base|))) (let ((.cse85 (select .cse86 .cse6))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse84) |c_~#queue~0.base| v_prenex_6) |c_~#stored_elements~0.base|) .cse2)))) (= (_ bv400 32) .cse85) (not (= (select .cse86 .cse8) v_DerPreprocessor_39)) (not (= (select .cse86 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse85))) (_ bv0 32))))))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse91 (store |c_#memory_int| |c_~#queue~0.base| (store .cse25 .cse8 v_DerPreprocessor_39)))) (let ((.cse90 (store (select .cse91 |c_~#stored_elements~0.base|) .cse13 v_DerPreprocessor_40))) (let ((.cse89 (select (store .cse91 |c_~#stored_elements~0.base| .cse90) |c_~#queue~0.base|))) (let ((.cse88 (select .cse89 .cse6))) (or (= (_ bv400 32) .cse88) (not (= (select .cse89 .cse8) v_DerPreprocessor_39)) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse90) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse2) (_ bv0 32)))) (= (select .cse89 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse88))) (_ bv0 32)))))))))))))))))) is different from true [2024-10-16 08:45:00,746 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (bvadd (_ bv1604 32) |c_~#queue~0.offset|))) (let ((.cse54 (select .cse0 .cse2)) (.cse34 (bvadd (_ bv1608 32) |c_~#queue~0.offset|))) (let ((.cse35 (bvadd (_ bv1 32) (select .cse0 .cse34))) (.cse88 (bvmul (_ bv4 32) |c_t1Thread1of1ForFork1_~i~0#1|)) (.cse89 (bvmul (_ bv4 32) .cse54))) (let ((.cse1 (bvadd |c_~#queue~0.offset| .cse89)) (.cse53 (= (_ bv1608 32) .cse89)) (.cse29 (= |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse52 (bvadd .cse88 |c_~#stored_elements~0.offset|)) (.cse16 (= (_ bv1604 32) .cse89)) (.cse4 (bvadd (_ bv4 32) (bvmul |c_t2Thread1of1ForFork0_~i~1#1| (_ bv4 32)) |c_~#stored_elements~0.offset|)) (.cse7 (bvadd (_ bv1600 32) |c_~#queue~0.offset|)) (.cse9 (bvadd (_ bv4 32) .cse88 |c_~#stored_elements~0.offset|)) (.cse21 (store .cse0 .cse34 .cse35))) (and (or (forall ((v_ArrVal_377 (_ BitVec 32))) (not (= (_ bv400 32) (select (store .cse0 .cse1 v_ArrVal_377) .cse2)))) (and (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse3 (store (select .cse8 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_46))) (let ((.cse6 (select (store .cse8 |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base|))) (let ((.cse5 (select .cse6 .cse7))) (or (forall ((v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse3) |c_~#queue~0.base| v_prenex_10) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32)))) (= .cse5 (_ bv400 32)) (not (= (_ bv0 32) (select .cse6 (bvadd |c_~#queue~0.offset| (bvmul .cse5 (_ bv4 32)))))))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse10 (store (select .cse13 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_46))) (let ((.cse12 (select (store .cse13 |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base|))) (let ((.cse11 (select .cse12 .cse7))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse10) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4)))) (= .cse11 (_ bv400 32)) (= (_ bv0 32) (select .cse12 (bvadd |c_~#queue~0.offset| (bvmul .cse11 (_ bv4 32))))))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse15 (store (select .cse14 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_46))) (or (not (= (select (select (store .cse14 |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base|) .cse7) (_ bv400 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse15) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4))))))))) (or .cse16 (let ((.cse28 (= .cse1 .cse9))) (and (or (and (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse20 (store |c_#memory_int| |c_~#queue~0.base| (store .cse21 .cse2 v_DerPreprocessor_47)))) (let ((.cse19 (store (select .cse20 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_48))) (let ((.cse17 (select (store .cse20 |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base|))) (let ((.cse18 (select .cse17 .cse7))) (or (not (= (_ bv0 32) (select .cse17 (bvadd |c_~#queue~0.offset| (bvmul .cse18 (_ bv4 32)))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse19) |c_~#queue~0.base| v_prenex_12) |c_~#stored_elements~0.base|) .cse4)))) (= .cse18 (_ bv400 32)))))))) (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse22 (store |c_#memory_int| |c_~#queue~0.base| (store .cse21 .cse2 v_DerPreprocessor_47)))) (let ((.cse23 (store (select .cse22 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_48))) (or (not (= (select (select (store .cse22 |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base|) .cse7) (_ bv400 32))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse23) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32)))))))) (forall ((v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse27 (store |c_#memory_int| |c_~#queue~0.base| (store .cse21 .cse2 v_DerPreprocessor_47)))) (let ((.cse26 (store (select .cse27 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_48))) (let ((.cse25 (select (store .cse27 |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base|))) (let ((.cse24 (select .cse25 .cse7))) (or (= .cse24 (_ bv400 32)) (= (_ bv0 32) (select .cse25 (bvadd |c_~#queue~0.offset| (bvmul .cse24 (_ bv4 32))))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse26) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32))))))))))) (not .cse28) (not .cse29)) (or (and (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse33 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_DerPreprocessor_49) .cse34 .cse35)))) (let ((.cse30 (store (select .cse33 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_50))) (let ((.cse32 (select (store .cse33 |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base|))) (let ((.cse31 (select .cse32 .cse7))) (or (forall ((v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse30) |c_~#queue~0.base| v_prenex_14) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32)))) (= (_ bv400 32) .cse31) (not (= (_ bv0 32) (select .cse32 (bvadd (bvmul (_ bv4 32) .cse31) |c_~#queue~0.offset|)))))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse39 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_DerPreprocessor_49) .cse34 .cse35)))) (let ((.cse38 (store (select .cse39 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_50))) (let ((.cse36 (select (store .cse39 |c_~#stored_elements~0.base| .cse38) |c_~#queue~0.base|))) (let ((.cse37 (select .cse36 .cse7))) (or (= (_ bv0 32) (select .cse36 (bvadd (bvmul (_ bv4 32) .cse37) |c_~#queue~0.offset|))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse38) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32)))) (= (_ bv400 32) .cse37))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse41 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_DerPreprocessor_49) .cse34 .cse35)))) (let ((.cse40 (store (select .cse41 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_50))) (or (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse40) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4)))) (not (= (_ bv400 32) (select (select (store .cse41 |c_~#stored_elements~0.base| .cse40) |c_~#queue~0.base|) .cse7))))))) (or (and (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse45 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 .cse1 v_DerPreprocessor_51) .cse34 .cse35) .cse2 v_DerPreprocessor_52)))) (let ((.cse42 (store (select .cse45 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_53))) (let ((.cse43 (select (store .cse45 |c_~#stored_elements~0.base| .cse42) |c_~#queue~0.base|))) (let ((.cse44 (select .cse43 .cse7))) (or (forall ((v_prenex_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse42) |c_~#queue~0.base| v_prenex_15) |c_~#stored_elements~0.base|) .cse4)))) (not (= (select .cse43 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse44))) (_ bv0 32))) (= (_ bv400 32) .cse44))))))) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse47 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 .cse1 v_DerPreprocessor_51) .cse34 .cse35) .cse2 v_DerPreprocessor_52)))) (let ((.cse46 (store (select .cse47 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_53))) (or (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse46) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4)))) (not (= (_ bv400 32) (select (select (store .cse47 |c_~#stored_elements~0.base| .cse46) |c_~#queue~0.base|) .cse7))))))) (forall ((v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse51 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse0 .cse1 v_DerPreprocessor_51) .cse34 .cse35) .cse2 v_DerPreprocessor_52)))) (let ((.cse48 (store (select .cse51 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_53))) (let ((.cse49 (select (store .cse51 |c_~#stored_elements~0.base| .cse48) |c_~#queue~0.base|))) (let ((.cse50 (select .cse49 .cse7))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse48) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4)))) (= (select .cse49 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse50))) (_ bv0 32)) (= (_ bv400 32) .cse50)))))))) (and (= .cse52 .cse7) .cse29))) (and .cse28 .cse29)))) .cse53 (= (_ bv400 32) .cse54)) (or (not .cse53) (let ((.cse66 (= .cse2 .cse52))) (and (or (and (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse58 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse34 v_DerPreprocessor_43) .cse2 v_DerPreprocessor_44)))) (let ((.cse55 (store (select .cse58 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_45))) (let ((.cse56 (select (store .cse58 |c_~#stored_elements~0.base| .cse55) |c_~#queue~0.base|))) (let ((.cse57 (select .cse56 .cse7))) (or (forall ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse55) |c_~#queue~0.base| v_prenex_9) |c_~#stored_elements~0.base|) .cse4)))) (not (= v_DerPreprocessor_44 (select .cse56 .cse2))) (not (= (_ bv0 32) (select .cse56 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse57))))) (= (_ bv400 32) .cse57))))))) (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse61 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse34 v_DerPreprocessor_43) .cse2 v_DerPreprocessor_44)))) (let ((.cse60 (store (select .cse61 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_45))) (let ((.cse59 (select (store .cse61 |c_~#stored_elements~0.base| .cse60) |c_~#queue~0.base|))) (or (not (= (_ bv400 32) (select .cse59 .cse7))) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse60) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32)))) (not (= v_DerPreprocessor_44 (select .cse59 .cse2)))))))) (forall ((v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse65 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse34 v_DerPreprocessor_43) .cse2 v_DerPreprocessor_44)))) (let ((.cse64 (store (select .cse65 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_45))) (let ((.cse62 (select (store .cse65 |c_~#stored_elements~0.base| .cse64) |c_~#queue~0.base|))) (let ((.cse63 (select .cse62 .cse7))) (or (= (_ bv0 32) (select .cse62 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse63)))) (not (= v_DerPreprocessor_44 (select .cse62 .cse2))) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse64) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4)))) (= (_ bv400 32) .cse63)))))))) (and .cse66 .cse29)) (or (not .cse66) (and (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse70 (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse2 v_DerPreprocessor_41)))) (let ((.cse67 (store (select .cse70 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_42))) (let ((.cse68 (select (store .cse70 |c_~#stored_elements~0.base| .cse67) |c_~#queue~0.base|))) (let ((.cse69 (select .cse68 .cse7))) (or (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse67) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32)))) (= (_ bv0 32) (select .cse68 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse69)))) (= (_ bv400 32) .cse69))))))) (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse74 (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse2 v_DerPreprocessor_41)))) (let ((.cse72 (store (select .cse74 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_42))) (let ((.cse73 (select (store .cse74 |c_~#stored_elements~0.base| .cse72) |c_~#queue~0.base|))) (let ((.cse71 (select .cse73 .cse7))) (or (= (_ bv400 32) .cse71) (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse72) |c_~#queue~0.base| v_prenex_8) |c_~#stored_elements~0.base|) .cse4)))) (not (= (_ bv0 32) (select .cse73 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse71))))))))))) (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32))) (let ((.cse76 (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse2 v_DerPreprocessor_41)))) (let ((.cse75 (store (select .cse76 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_42))) (or (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse75) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4)))) (not (= (_ bv400 32) (select (select (store .cse76 |c_~#stored_elements~0.base| .cse75) |c_~#queue~0.base|) .cse7)))))))))))) (or (not .cse16) (and (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse79 (store |c_#memory_int| |c_~#queue~0.base| (store .cse21 .cse2 v_DerPreprocessor_39)))) (let ((.cse78 (store (select .cse79 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_40))) (let ((.cse77 (select (store .cse79 |c_~#stored_elements~0.base| .cse78) |c_~#queue~0.base|))) (or (not (= (_ bv400 32) (select .cse77 .cse7))) (not (= (select .cse77 .cse2) v_DerPreprocessor_39)) (forall ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse78) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4))))))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse83 (store |c_#memory_int| |c_~#queue~0.base| (store .cse21 .cse2 v_DerPreprocessor_39)))) (let ((.cse80 (store (select .cse83 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_40))) (let ((.cse82 (select (store .cse83 |c_~#stored_elements~0.base| .cse80) |c_~#queue~0.base|))) (let ((.cse81 (select .cse82 .cse7))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse80) |c_~#queue~0.base| v_prenex_6) |c_~#stored_elements~0.base|) .cse4)))) (= (_ bv400 32) .cse81) (not (= (select .cse82 .cse2) v_DerPreprocessor_39)) (not (= (select .cse82 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse81))) (_ bv0 32))))))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse87 (store |c_#memory_int| |c_~#queue~0.base| (store .cse21 .cse2 v_DerPreprocessor_39)))) (let ((.cse86 (store (select .cse87 |c_~#stored_elements~0.base|) .cse9 v_DerPreprocessor_40))) (let ((.cse85 (select (store .cse87 |c_~#stored_elements~0.base| .cse86) |c_~#queue~0.base|))) (let ((.cse84 (select .cse85 .cse7))) (or (= (_ bv400 32) .cse84) (not (= (select .cse85 .cse2) v_DerPreprocessor_39)) (forall ((v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse86) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32)))) (= (select .cse85 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse84))) (_ bv0 32))))))))))))))) is different from true [2024-10-16 08:45:50,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse53 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (bvadd (_ bv1604 32) |c_~#queue~0.offset|))) (let ((.cse164 (select .cse53 .cse8))) (let ((.cse166 (bvmul (_ bv4 32) |c_t1Thread1of1ForFork1_~i~0#1|)) (.cse165 (bvmul (_ bv4 32) .cse164))) (let ((.cse3 (bvadd (_ bv1600 32) |c_~#queue~0.offset|)) (.cse22 (bvadd |c_~#queue~0.offset| .cse165)) (.cse5 (bvadd (_ bv4 32) .cse166 |c_~#stored_elements~0.offset|)) (.cse163 (bvadd .cse166 |c_~#stored_elements~0.offset|))) (let ((.cse160 (= .cse8 .cse163)) (.cse41 (= (_ bv1608 32) .cse165)) (.cse162 (= .cse22 .cse5)) (.cse161 (= |c_~#stored_elements~0.base| |c_~#queue~0.base|)) (.cse0 (= (_ bv1604 32) .cse165)) (.cse91 (select .cse53 .cse3))) (let ((.cse92 (= (_ bv400 32) .cse91)) (.cse55 (not .cse0)) (.cse42 (= (_ bv400 32) .cse164)) (.cse33 (and (= .cse163 .cse3) .cse161)) (.cse40 (and .cse162 .cse161)) (.cse16 (not .cse162)) (.cse17 (not .cse161)) (.cse67 (not .cse41)) (.cse79 (and .cse160 .cse161)) (.cse4 (bvadd (_ bv4 32) (bvmul |c_t2Thread1of1ForFork0_~i~1#1| (_ bv4 32)) |c_~#stored_elements~0.offset|)) (.cse7 (bvadd (_ bv1608 32) |c_~#queue~0.offset|)) (.cse90 (not .cse160))) (and (or (let ((.cse54 (bvadd (_ bv1 32) .cse91))) (let ((.cse6 (store .cse53 .cse3 .cse54))) (and (or .cse0 (and (or (and (forall ((v_prenex_164 (_ BitVec 32)) (v_prenex_188 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_165 (_ BitVec 32))) (let ((.cse1 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_prenex_164)))) (let ((.cse2 (store (select .cse1 |c_~#stored_elements~0.base|) .cse5 v_prenex_165))) (or (not (= (_ bv400 32) (select (select (store .cse1 |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base|) .cse3))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse2) |c_~#queue~0.base| v_prenex_188) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_prenex_189 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_167 (_ BitVec 32)) (v_prenex_166 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_prenex_166)))) (let ((.cse9 (store (select .cse12 |c_~#stored_elements~0.base|) .cse5 v_prenex_167))) (let ((.cse11 (select (store .cse12 |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base|))) (let ((.cse10 (select .cse11 .cse3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse9) |c_~#queue~0.base| v_prenex_189) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32))) (= .cse10 (_ bv400 32)) (= (_ bv0 32) (select .cse11 (bvadd |c_~#queue~0.offset| (bvmul .cse10 (_ bv4 32))))))))))) (forall ((v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_DerPreprocessor_47)))) (let ((.cse13 (store (select .cse15 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_48))) (or (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base| v_prenex_12) |c_~#stored_elements~0.base|) .cse4))) (not (= (_ bv0 32) (let ((.cse14 (select (store .cse15 |c_~#stored_elements~0.base| .cse13) |c_~#queue~0.base|))) (select .cse14 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse14 .cse3)))))))))))) .cse16 .cse17) (or (and (forall ((v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_176 (_ BitVec 32)) (v_prenex_177 (_ BitVec 32)) (v_prenex_181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse22 v_prenex_177) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55))))) (let ((.cse20 (store (select .cse21 |c_~#stored_elements~0.base|) .cse5 v_prenex_176))) (let ((.cse19 (select (store .cse21 |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base|))) (let ((.cse18 (select .cse19 .cse3))) (or (= (_ bv400 32) .cse18) (= (select .cse19 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse18))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse20) |c_~#queue~0.base| v_prenex_181) |c_~#stored_elements~0.base|) .cse4))))))))) (or (and (forall ((v_prenex_170 (_ BitVec 32)) (v_prenex_179 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_169 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_168 (_ BitVec 32))) (let ((.cse26 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse22 v_prenex_169) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_prenex_170)))) (let ((.cse25 (store (select .cse26 |c_~#stored_elements~0.base|) .cse5 v_prenex_168))) (let ((.cse23 (select (store .cse26 |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base|))) (let ((.cse24 (select .cse23 .cse3))) (or (= (_ bv0 32) (select .cse23 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse24)))) (= (_ bv400 32) .cse24) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse25) |c_~#queue~0.base| v_prenex_179) |c_~#stored_elements~0.base|) .cse4))))))))) (forall ((v_prenex_172 (_ BitVec 32)) (v_prenex_173 (_ BitVec 32)) (v_prenex_171 (_ BitVec 32)) (v_prenex_178 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_55 (_ BitVec 32))) (let ((.cse27 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse22 v_prenex_172) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_prenex_173)))) (let ((.cse28 (store (select .cse27 |c_~#stored_elements~0.base|) .cse5 v_prenex_171))) (or (not (= (select (select (store .cse27 |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base|) .cse3) (_ bv400 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse28) |c_~#queue~0.base| v_prenex_178) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_prenex_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32))) (let ((.cse32 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse6 .cse22 v_DerPreprocessor_51) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_DerPreprocessor_52)))) (let ((.cse31 (store (select .cse32 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_53))) (let ((.cse29 (select (store .cse32 |c_~#stored_elements~0.base| .cse31) |c_~#queue~0.base|))) (let ((.cse30 (select .cse29 .cse3))) (or (not (= (_ bv0 32) (select .cse29 (bvadd (bvmul (_ bv4 32) .cse30) |c_~#queue~0.offset|)))) (= (_ bv400 32) .cse30) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse31) |c_~#queue~0.base| v_prenex_15) |c_~#stored_elements~0.base|) .cse4)))))))))) .cse33) (forall ((v_prenex_174 (_ BitVec 32)) (v_prenex_175 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_180 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse22 v_prenex_175) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55))))) (let ((.cse35 (store (select .cse34 |c_~#stored_elements~0.base|) .cse5 v_prenex_174))) (or (not (= (_ bv400 32) (select (select (store .cse34 |c_~#stored_elements~0.base| .cse35) |c_~#queue~0.base|) .cse3))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse35) |c_~#queue~0.base| v_prenex_180) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse39 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse22 v_DerPreprocessor_49) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55))))) (let ((.cse36 (store (select .cse39 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_50))) (let ((.cse38 (select (store .cse39 |c_~#stored_elements~0.base| .cse36) |c_~#queue~0.base|))) (let ((.cse37 (select .cse38 .cse3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse36) |c_~#queue~0.base| v_prenex_14) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32))) (= (_ bv400 32) .cse37) (not (= (_ bv0 32) (select .cse38 (bvadd (bvmul (_ bv4 32) .cse37) |c_~#queue~0.offset|))))))))))) .cse40)) .cse41 .cse42) (or (and (forall ((v_prenex_161 (_ BitVec 32)) (v_prenex_187 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_160 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store |c_#memory_int| |c_~#queue~0.base| v_prenex_160))) (let ((.cse44 (store (select .cse46 |c_~#stored_elements~0.base|) .cse5 v_prenex_161))) (let ((.cse45 (select (store .cse46 |c_~#stored_elements~0.base| .cse44) |c_~#queue~0.base|))) (let ((.cse43 (select .cse45 .cse3))) (or (= (_ bv400 32) .cse43) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse44) |c_~#queue~0.base| v_prenex_187) |c_~#stored_elements~0.base|) .cse4))) (= (_ bv0 32) (select .cse45 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse43)))))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32)) (v_prenex_186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse47 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse48 (store (select .cse47 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_46))) (or (not (= (select (select (store .cse47 |c_~#stored_elements~0.base| .cse48) |c_~#queue~0.base|) .cse3) (_ bv400 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse48) |c_~#queue~0.base| v_prenex_186) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_prenex_163 (_ BitVec 32)) (v_prenex_162 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (store |c_#memory_int| |c_~#queue~0.base| v_prenex_162))) (let ((.cse49 (store (select .cse52 |c_~#stored_elements~0.base|) .cse5 v_prenex_163))) (let ((.cse50 (select (store .cse52 |c_~#stored_elements~0.base| .cse49) |c_~#queue~0.base|))) (let ((.cse51 (select .cse50 .cse3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse49) |c_~#queue~0.base| v_prenex_10) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32))) (not (= (_ bv0 32) (select .cse50 (bvadd (bvmul (_ bv4 32) .cse51) |c_~#queue~0.offset|)))) (= (_ bv400 32) .cse51)))))))) (forall ((v_DerPreprocessor_55 (_ BitVec 32)) (v_ArrVal_377 (_ BitVec 32))) (not (= (_ bv400 32) (select (store (store (store .cse53 .cse7 v_DerPreprocessor_55) .cse3 .cse54) .cse22 v_ArrVal_377) .cse8))))) (or .cse55 (and (forall ((v_prenex_185 (_ BitVec 32)) (v_prenex_184 (_ BitVec 32)) (v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_55 (_ BitVec 32))) (let ((.cse59 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_prenex_185)))) (let ((.cse57 (store (select .cse59 |c_~#stored_elements~0.base|) .cse5 v_prenex_184))) (let ((.cse58 (select (store .cse59 |c_~#stored_elements~0.base| .cse57) |c_~#queue~0.base|))) (let ((.cse56 (select .cse58 .cse3))) (or (= (_ bv400 32) .cse56) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse57) |c_~#queue~0.base| v_prenex_6) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32))) (not (= (select .cse58 (bvadd (bvmul (_ bv4 32) .cse56) |c_~#queue~0.offset|)) (_ bv0 32))) (not (= v_prenex_185 (select .cse58 .cse8))))))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32)) (v_prenex_191 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse63 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_DerPreprocessor_39)))) (let ((.cse60 (store (select .cse63 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_40))) (let ((.cse61 (select (store .cse63 |c_~#stored_elements~0.base| .cse60) |c_~#queue~0.base|))) (let ((.cse62 (select .cse61 .cse3))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse60) |c_~#queue~0.base| v_prenex_191) |c_~#stored_elements~0.base|) .cse4))) (not (= (select .cse61 .cse8) v_DerPreprocessor_39)) (= (_ bv0 32) (select .cse61 (bvadd (bvmul (_ bv4 32) .cse62) |c_~#queue~0.offset|))) (= (_ bv400 32) .cse62))))))) (forall ((v_prenex_183 (_ BitVec 32)) (v_prenex_182 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse66 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_55)) .cse8 v_prenex_183)))) (let ((.cse65 (store (select .cse66 |c_~#stored_elements~0.base|) .cse5 v_prenex_182))) (let ((.cse64 (select (store .cse66 |c_~#stored_elements~0.base| .cse65) |c_~#queue~0.base|))) (or (not (= (select .cse64 .cse3) (_ bv400 32))) (not (= v_prenex_183 (select .cse64 .cse8))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse65) |c_~#queue~0.base| v_prenex_190) |c_~#stored_elements~0.base|) .cse4)))))))))) (or .cse67 (and (or (and (forall ((v_prenex_159 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse71 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_DerPreprocessor_43) .cse8 v_DerPreprocessor_44)))) (let ((.cse69 (store (select .cse71 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_45))) (let ((.cse70 (select (store .cse71 |c_~#stored_elements~0.base| .cse69) |c_~#queue~0.base|))) (let ((.cse68 (select .cse70 .cse3))) (or (= .cse68 (_ bv400 32)) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse69) |c_~#queue~0.base| v_prenex_159) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32))) (not (= (select .cse70 .cse8) v_DerPreprocessor_44)) (= (_ bv0 32) (select .cse70 (bvadd |c_~#queue~0.offset| (bvmul .cse68 (_ bv4 32))))))))))) (forall ((v_prenex_156 (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_157 (_ BitVec 32)) (v_prenex_155 (_ BitVec 32))) (let ((.cse75 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_prenex_155) .cse8 v_prenex_156)))) (let ((.cse74 (store (select .cse75 |c_~#stored_elements~0.base|) .cse5 v_prenex_157))) (let ((.cse72 (select (store .cse75 |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base|))) (let ((.cse73 (select .cse72 .cse3))) (or (not (= (_ bv0 32) (select .cse72 (bvadd |c_~#queue~0.offset| (bvmul .cse73 (_ bv4 32)))))) (= .cse73 (_ bv400 32)) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse74) |c_~#queue~0.base| v_prenex_9) |c_~#stored_elements~0.base|) .cse4))) (not (= v_prenex_156 (select .cse72 .cse8))))))))) (forall ((v_prenex_152 (_ BitVec 32)) (v_prenex_153 (_ BitVec 32)) (v_prenex_158 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_154 (_ BitVec 32))) (let ((.cse78 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse7 v_prenex_152) .cse8 v_prenex_153)))) (let ((.cse77 (store (select .cse78 |c_~#stored_elements~0.base|) .cse5 v_prenex_154))) (let ((.cse76 (select (store .cse78 |c_~#stored_elements~0.base| .cse77) |c_~#queue~0.base|))) (or (not (= (_ bv400 32) (select .cse76 .cse3))) (not (= v_prenex_153 (select .cse76 .cse8))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse77) |c_~#queue~0.base| v_prenex_158) |c_~#stored_elements~0.base|) .cse4))))))))) .cse79) (or (and (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse83 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse53 .cse7 v_DerPreprocessor_55) .cse3 .cse54) .cse8 v_DerPreprocessor_41)))) (let ((.cse82 (store (select .cse83 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_42))) (let ((.cse80 (select (store .cse83 |c_~#stored_elements~0.base| .cse82) |c_~#queue~0.base|))) (let ((.cse81 (select .cse80 .cse3))) (or (= (_ bv0 32) (select .cse80 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse81)))) (= (_ bv400 32) .cse81) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse82) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4))))))))) (forall ((v_prenex_149 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_148 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse84 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse53 .cse7 v_DerPreprocessor_55) .cse3 .cse54) .cse8 v_prenex_149)))) (let ((.cse85 (store (select .cse84 |c_~#stored_elements~0.base|) .cse5 v_prenex_148))) (or (not (= (_ bv400 32) (select (select (store .cse84 |c_~#stored_elements~0.base| .cse85) |c_~#queue~0.base|) .cse3))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse85) |c_~#queue~0.base| v_DerPreprocessor_32) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_prenex_150 (_ BitVec 32)) (v_prenex_151 (_ BitVec 32)) (v_DerPreprocessor_55 (_ BitVec 32)) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse89 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse53 .cse7 v_DerPreprocessor_55) .cse3 .cse54) .cse8 v_prenex_151)))) (let ((.cse86 (store (select .cse89 |c_~#stored_elements~0.base|) .cse5 v_prenex_150))) (let ((.cse88 (select (store .cse89 |c_~#stored_elements~0.base| .cse86) |c_~#queue~0.base|))) (let ((.cse87 (select .cse88 .cse3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse86) |c_~#queue~0.base| v_prenex_8) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32))) (= (_ bv400 32) .cse87) (not (= (_ bv0 32) (select .cse88 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse87)))))))))))) .cse90)))))) .cse92) (or (not .cse92) (let ((.cse97 (store .cse53 .cse3 (_ bv1 32)))) (and (or .cse55 (and (forall ((v_prenex_147 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_40 (_ BitVec 32)) (v_DerPreprocessor_39 (_ BitVec 32))) (let ((.cse96 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_DerPreprocessor_39)))) (let ((.cse95 (store (select .cse96 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_40))) (let ((.cse93 (select (store .cse96 |c_~#stored_elements~0.base| .cse95) |c_~#queue~0.base|))) (let ((.cse94 (select .cse93 .cse3))) (or (not (= v_DerPreprocessor_39 (select .cse93 .cse8))) (= (_ bv400 32) .cse94) (= (_ bv0 32) (select .cse93 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse94)))) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse95) |c_~#queue~0.base| v_prenex_147) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32))))))))) (forall ((v_prenex_141 (_ BitVec 32)) (v_prenex_140 (_ BitVec 32)) (v_prenex_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32))) (let ((.cse101 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_prenex_141)))) (let ((.cse100 (store (select .cse101 |c_~#stored_elements~0.base|) .cse5 v_prenex_140))) (let ((.cse99 (select (store .cse101 |c_~#stored_elements~0.base| .cse100) |c_~#queue~0.base|))) (let ((.cse98 (select .cse99 .cse3))) (or (= (_ bv400 32) .cse98) (not (= (select .cse99 .cse8) v_prenex_141)) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse100) |c_~#queue~0.base| v_prenex_6) |c_~#stored_elements~0.base|) .cse4))) (not (= (select .cse99 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse98))) (_ bv0 32))))))))) (forall ((v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_146 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_138 (_ BitVec 32)) (v_prenex_139 (_ BitVec 32))) (let ((.cse102 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_prenex_139)))) (let ((.cse103 (store (select .cse102 |c_~#stored_elements~0.base|) .cse5 v_prenex_138))) (or (not (= (select (select (store .cse102 |c_~#stored_elements~0.base| .cse103) |c_~#queue~0.base|) .cse3) (_ bv400 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse103) |c_~#queue~0.base| v_prenex_146) |c_~#stored_elements~0.base|) .cse4))))))))) (or .cse0 .cse41 .cse42 (and (or (and (or .cse33 (and (forall ((v_prenex_15 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_53 (_ BitVec 32)) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_51 (_ BitVec 32)) (v_DerPreprocessor_52 (_ BitVec 32))) (let ((.cse107 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse97 .cse22 v_DerPreprocessor_51) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_DerPreprocessor_52)))) (let ((.cse104 (store (select .cse107 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_53))) (let ((.cse106 (select (store .cse107 |c_~#stored_elements~0.base| .cse104) |c_~#queue~0.base|))) (let ((.cse105 (select .cse106 .cse3))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse104) |c_~#queue~0.base| v_prenex_15) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32))) (= (_ bv400 32) .cse105) (not (= (_ bv0 32) (select .cse106 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse105))))))))))) (forall ((v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_129 (_ BitVec 32)) (v_prenex_134 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_127 (_ BitVec 32)) (v_prenex_128 (_ BitVec 32))) (let ((.cse108 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse97 .cse22 v_prenex_128) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_prenex_129)))) (let ((.cse109 (store (select .cse108 |c_~#stored_elements~0.base|) .cse5 v_prenex_127))) (or (not (= (_ bv400 32) (select (select (store .cse108 |c_~#stored_elements~0.base| .cse109) |c_~#queue~0.base|) .cse3))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse109) |c_~#queue~0.base| v_prenex_134) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_135 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_125 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32))) (let ((.cse113 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse97 .cse22 v_prenex_125) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_prenex_126)))) (let ((.cse112 (store (select .cse113 |c_~#stored_elements~0.base|) .cse5 v_prenex_124))) (let ((.cse110 (select (store .cse113 |c_~#stored_elements~0.base| .cse112) |c_~#queue~0.base|))) (let ((.cse111 (select .cse110 .cse3))) (or (= (_ bv0 32) (select .cse110 (bvadd |c_~#queue~0.offset| (bvmul .cse111 (_ bv4 32))))) (= .cse111 (_ bv400 32)) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse112) |c_~#queue~0.base| v_prenex_135) |c_~#stored_elements~0.base|) .cse4))))))))))) (forall ((v_prenex_130 (_ BitVec 32)) (v_prenex_131 (_ BitVec 32)) (v_prenex_136 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32))) (let ((.cse114 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse22 v_prenex_131) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54))))) (let ((.cse115 (store (select .cse114 |c_~#stored_elements~0.base|) .cse5 v_prenex_130))) (or (not (= (select (select (store .cse114 |c_~#stored_elements~0.base| .cse115) |c_~#queue~0.base|) .cse3) (_ bv400 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse115) |c_~#queue~0.base| v_prenex_136) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_prenex_137 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_132 (_ BitVec 32)) (v_prenex_133 (_ BitVec 32))) (let ((.cse119 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse22 v_prenex_133) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54))))) (let ((.cse118 (store (select .cse119 |c_~#stored_elements~0.base|) .cse5 v_prenex_132))) (let ((.cse116 (select (store .cse119 |c_~#stored_elements~0.base| .cse118) |c_~#queue~0.base|))) (let ((.cse117 (select .cse116 .cse3))) (or (= (_ bv0 32) (select .cse116 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse117)))) (= (_ bv400 32) .cse117) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse118) |c_~#queue~0.base| v_prenex_137) |c_~#stored_elements~0.base|) .cse4))))))))) (forall ((v_DerPreprocessor_50 (_ BitVec 32)) (v_prenex_14 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_49 (_ BitVec 32))) (let ((.cse123 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse22 v_DerPreprocessor_49) .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54))))) (let ((.cse122 (store (select .cse123 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_50))) (let ((.cse120 (select (store .cse123 |c_~#stored_elements~0.base| .cse122) |c_~#queue~0.base|))) (let ((.cse121 (select .cse120 .cse3))) (or (not (= (_ bv0 32) (select .cse120 (bvadd (bvmul (_ bv4 32) .cse121) |c_~#queue~0.offset|)))) (= (_ bv400 32) .cse121) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse122) |c_~#queue~0.base| v_prenex_14) |c_~#stored_elements~0.base|) .cse4)))))))))) .cse40) (or (and (forall ((v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_145 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_123 (_ BitVec 32)) (v_prenex_122 (_ BitVec 32))) (let ((.cse127 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_prenex_122)))) (let ((.cse126 (store (select .cse127 |c_~#stored_elements~0.base|) .cse5 v_prenex_123))) (let ((.cse125 (select (store .cse127 |c_~#stored_elements~0.base| .cse126) |c_~#queue~0.base|))) (let ((.cse124 (select .cse125 .cse3))) (or (= (_ bv400 32) .cse124) (= (_ bv0 32) (select .cse125 (bvadd (bvmul (_ bv4 32) .cse124) |c_~#queue~0.offset|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse126) |c_~#queue~0.base| v_prenex_145) |c_~#stored_elements~0.base|) .cse4))))))))) (forall ((v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_47 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (let ((.cse131 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_DerPreprocessor_47)))) (let ((.cse130 (store (select .cse131 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_48))) (let ((.cse129 (select (store .cse131 |c_~#stored_elements~0.base| .cse130) |c_~#queue~0.base|))) (let ((.cse128 (select .cse129 .cse3))) (or (= (_ bv400 32) .cse128) (not (= (select .cse129 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse128))) (_ bv0 32))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse130) |c_~#queue~0.base| v_prenex_12) |c_~#stored_elements~0.base|) .cse4))))))))) (forall ((v_prenex_120 (_ BitVec 32)) (v_prenex_144 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse133 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 (bvadd (_ bv1 32) v_DerPreprocessor_54)) .cse8 v_prenex_120)))) (let ((.cse132 (store (select .cse133 |c_~#stored_elements~0.base|) .cse5 v_prenex_121))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse132) |c_~#queue~0.base| v_prenex_144) |c_~#stored_elements~0.base|) .cse4))) (not (= (_ bv400 32) (select (select (store .cse133 |c_~#stored_elements~0.base| .cse132) |c_~#queue~0.base|) .cse3)))))))) .cse16 .cse17))) (or (forall ((v_DerPreprocessor_54 (_ BitVec 32)) (v_ArrVal_377 (_ BitVec 32))) (not (= (_ bv400 32) (select (store (store (store .cse53 .cse7 v_DerPreprocessor_54) .cse3 (_ bv1 32)) .cse22 v_ArrVal_377) .cse8)))) (and (forall ((v_prenex_116 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_143 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_117 (_ BitVec 32))) (let ((.cse137 (store |c_#memory_int| |c_~#queue~0.base| v_prenex_116))) (let ((.cse134 (store (select .cse137 |c_~#stored_elements~0.base|) .cse5 v_prenex_117))) (let ((.cse136 (select (store .cse137 |c_~#stored_elements~0.base| .cse134) |c_~#queue~0.base|))) (let ((.cse135 (select .cse136 .cse3))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse134) |c_~#queue~0.base| v_prenex_143) |c_~#stored_elements~0.base|) .cse4))) (= .cse135 (_ bv400 32)) (= (_ bv0 32) (select .cse136 (bvadd |c_~#queue~0.offset| (bvmul .cse135 (_ bv4 32))))))))))) (forall ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_46 (_ BitVec 32)) (v_prenex_142 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse139 (store |c_#memory_int| |c_~#queue~0.base| v_DerPreprocessor_38))) (let ((.cse138 (store (select .cse139 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_46))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse138) |c_~#queue~0.base| v_prenex_142) |c_~#stored_elements~0.base|) .cse4))) (not (= (select (select (store .cse139 |c_~#stored_elements~0.base| .cse138) |c_~#queue~0.base|) .cse3) (_ bv400 32))))))) (forall ((v_prenex_119 (_ BitVec 32)) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_118 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse143 (store |c_#memory_int| |c_~#queue~0.base| v_prenex_118))) (let ((.cse142 (store (select .cse143 |c_~#stored_elements~0.base|) .cse5 v_prenex_119))) (let ((.cse140 (select (store .cse143 |c_~#stored_elements~0.base| .cse142) |c_~#queue~0.base|))) (let ((.cse141 (select .cse140 .cse3))) (or (not (= (_ bv0 32) (select .cse140 (bvadd (bvmul (_ bv4 32) .cse141) |c_~#queue~0.offset|)))) (= (_ bv400 32) .cse141) (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse142) |c_~#queue~0.base| v_prenex_10) |c_~#stored_elements~0.base|) .cse4) (_ bv1 32))))))))))) (or .cse67 (and (or .cse79 (and (forall ((v_prenex_115 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (_ BitVec 32)) (v_DerPreprocessor_44 (_ BitVec 32)) (v_DerPreprocessor_45 (_ BitVec 32))) (let ((.cse147 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 v_DerPreprocessor_43) .cse8 v_DerPreprocessor_44)))) (let ((.cse146 (store (select .cse147 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_45))) (let ((.cse144 (select (store .cse147 |c_~#stored_elements~0.base| .cse146) |c_~#queue~0.base|))) (let ((.cse145 (select .cse144 .cse3))) (or (= (_ bv0 32) (select .cse144 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse145)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse146) |c_~#queue~0.base| v_prenex_115) |c_~#stored_elements~0.base|) .cse4))) (= (_ bv400 32) .cse145) (not (= (select .cse144 .cse8) v_DerPreprocessor_44)))))))) (forall ((v_prenex_114 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_109 (_ BitVec 32)) (v_prenex_108 (_ BitVec 32)) (v_prenex_110 (_ BitVec 32))) (let ((.cse148 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 v_prenex_108) .cse8 v_prenex_109)))) (let ((.cse149 (store (select .cse148 |c_~#stored_elements~0.base|) .cse5 v_prenex_110))) (or (not (= (_ bv400 32) (select (select (store .cse148 |c_~#stored_elements~0.base| .cse149) |c_~#queue~0.base|) .cse3))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse149) |c_~#queue~0.base| v_prenex_114) |c_~#stored_elements~0.base|) .cse4))))))) (forall ((v_prenex_112 (_ BitVec 32)) (v_prenex_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_113 (_ BitVec 32)) (v_prenex_111 (_ BitVec 32))) (let ((.cse153 (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse97 .cse7 v_prenex_111) .cse8 v_prenex_112)))) (let ((.cse152 (store (select .cse153 |c_~#stored_elements~0.base|) .cse5 v_prenex_113))) (let ((.cse150 (select (store .cse153 |c_~#stored_elements~0.base| .cse152) |c_~#queue~0.base|))) (let ((.cse151 (select .cse150 .cse3))) (or (not (= (_ bv0 32) (select .cse150 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) .cse151))))) (= (_ bv400 32) .cse151) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse152) |c_~#queue~0.base| v_prenex_9) |c_~#stored_elements~0.base|) .cse4))) (not (= v_prenex_112 (select .cse150 .cse8))))))))))) (or (and (forall ((v_DerPreprocessor_42 (_ BitVec 32)) (v_DerPreprocessor_54 (_ BitVec 32)) (v_DerPreprocessor_41 (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse156 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse53 .cse7 v_DerPreprocessor_54) .cse3 (_ bv1 32)) .cse8 v_DerPreprocessor_41)))) (let ((.cse154 (store (select .cse156 |c_~#stored_elements~0.base|) .cse5 v_DerPreprocessor_42))) (or (not (= (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse154) |c_~#queue~0.base| v_DerPreprocessor_31) |c_~#stored_elements~0.base|) .cse4) (_ bv0 32))) (= (_ bv0 32) (let ((.cse155 (select (store .cse156 |c_~#stored_elements~0.base| .cse154) |c_~#queue~0.base|))) (select .cse155 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse155 .cse3)))))))))) (forall ((v_DerPreprocessor_54 (_ BitVec 32)) (v_prenex_107 (_ BitVec 32)) (v_prenex_106 (_ BitVec 32)) (v_prenex_8 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse158 (store |c_#memory_int| |c_~#queue~0.base| (store (store (store .cse53 .cse7 v_DerPreprocessor_54) .cse3 (_ bv1 32)) .cse8 v_prenex_107)))) (let ((.cse159 (store (select .cse158 |c_~#stored_elements~0.base|) .cse5 v_prenex_106))) (or (not (= (_ bv0 32) (let ((.cse157 (select (store .cse158 |c_~#stored_elements~0.base| .cse159) |c_~#queue~0.base|))) (select .cse157 (bvadd |c_~#queue~0.offset| (bvmul (_ bv4 32) (select .cse157 .cse3))))))) (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| .cse159) |c_~#queue~0.base| v_prenex_8) |c_~#stored_elements~0.base|) .cse4)))))))) .cse90))))))))))))) is different from true [2024-10-16 08:46:11,767 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-10-16 08:46:11,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-16 08:46:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990434549] [2024-10-16 08:46:11,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2024-10-16 08:46:11,770 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-16 08:46:11,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-16 08:46:11,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-16 08:46:11,972 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:194) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 66 more [2024-10-16 08:46:11,975 INFO L158 Benchmark]: Toolchain (without parser) took 221221.65ms. Allocated memory was 69.2MB in the beginning and 188.7MB in the end (delta: 119.5MB). Free memory was 40.8MB in the beginning and 50.2MB in the end (delta: -9.4MB). Peak memory consumption was 121.7MB. Max. memory is 16.1GB. [2024-10-16 08:46:11,975 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 69.2MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-16 08:46:11,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.32ms. Allocated memory was 69.2MB in the beginning and 107.0MB in the end (delta: 37.7MB). Free memory was 40.7MB in the beginning and 61.4MB in the end (delta: -20.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-10-16 08:46:11,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.86ms. Allocated memory is still 107.0MB. Free memory was 61.4MB in the beginning and 58.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-16 08:46:11,977 INFO L158 Benchmark]: Boogie Preprocessor took 51.47ms. Allocated memory is still 107.0MB. Free memory was 58.1MB in the beginning and 55.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-16 08:46:11,978 INFO L158 Benchmark]: RCFGBuilder took 870.17ms. Allocated memory is still 107.0MB. Free memory was 55.5MB in the beginning and 59.6MB in the end (delta: -4.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-16 08:46:11,978 INFO L158 Benchmark]: TraceAbstraction took 219549.89ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 58.2MB in the beginning and 50.2MB in the end (delta: 8.1MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2024-10-16 08:46:11,979 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.85ms. Allocated memory is still 69.2MB. Free memory is still 37.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 688.32ms. Allocated memory was 69.2MB in the beginning and 107.0MB in the end (delta: 37.7MB). Free memory was 40.7MB in the beginning and 61.4MB in the end (delta: -20.7MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.86ms. Allocated memory is still 107.0MB. Free memory was 61.4MB in the beginning and 58.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.47ms. Allocated memory is still 107.0MB. Free memory was 58.1MB in the beginning and 55.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 870.17ms. Allocated memory is still 107.0MB. Free memory was 55.5MB in the beginning and 59.6MB in the end (delta: -4.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * TraceAbstraction took 219549.89ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 58.2MB in the beginning and 50.2MB in the end (delta: 8.1MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 907, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 58, dependent conditional: 47, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 867, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 867, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 867, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 47, dependent conditional: 25, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 595, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 595, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10095, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 10017, dependent conditional: 2712, dependent unconditional: 7305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 896, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 31, dependent conditional: 5, dependent unconditional: 26, unknown: 595, unknown conditional: 5, unknown unconditional: 590] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 579, Positive conditional cache size: 0, Positive unconditional cache size: 579, Negative cache size: 16, Negative conditional cache size: 5, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 235, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 47, dependent conditional: 25, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 595, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 595, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10095, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 10017, dependent conditional: 2712, dependent unconditional: 7305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 896, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 31, dependent conditional: 5, dependent unconditional: 26, unknown: 595, unknown conditional: 5, unknown unconditional: 590] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 579, Positive conditional cache size: 0, Positive unconditional cache size: 579, Negative cache size: 16, Negative conditional cache size: 5, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 235 ], Independence queries for same thread: 40, Persistent sets #1 benchmarks: Persistent set computation time: 7.4s, Number of persistent set computation: 60, Number of trivial persistent sets: 49, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 640, independent: 629, independent conditional: 0, independent unconditional: 629, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 907, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 58, dependent conditional: 47, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 867, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 867, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 867, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 18, dependent conditional: 7, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 47, dependent conditional: 25, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 595, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 595, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10095, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 10017, dependent conditional: 2712, dependent unconditional: 7305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 896, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 31, dependent conditional: 5, dependent unconditional: 26, unknown: 595, unknown conditional: 5, unknown unconditional: 590] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 579, Positive conditional cache size: 0, Positive unconditional cache size: 579, Negative cache size: 16, Negative conditional cache size: 5, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 235, Maximal queried relation: 3, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 220, independent unconditional: 629, dependent: 47, dependent conditional: 25, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 896, independent: 849, independent conditional: 0, independent unconditional: 849, dependent: 47, dependent conditional: 10, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 595, independent: 579, independent conditional: 0, independent unconditional: 579, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 595, independent: 575, independent conditional: 0, independent unconditional: 575, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 16, dependent conditional: 5, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10095, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 10017, dependent conditional: 2712, dependent unconditional: 7305, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 896, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 31, dependent conditional: 5, dependent unconditional: 26, unknown: 595, unknown conditional: 5, unknown unconditional: 590] , Statistics on independence cache: Total cache size (in pairs): 595, Positive cache size: 579, Positive conditional cache size: 0, Positive unconditional cache size: 579, Negative cache size: 16, Negative conditional cache size: 5, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 235 ], Independence queries for same thread: 40 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 370, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 363, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 363, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 363, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 348, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 348, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 3109, dependent conditional: 0, dependent unconditional: 3109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 369, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 348, unknown conditional: 0, unknown unconditional: 348] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 342, Positive conditional cache size: 0, Positive unconditional cache size: 342, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 348, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 348, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 3109, dependent conditional: 0, dependent unconditional: 3109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 369, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 348, unknown conditional: 0, unknown unconditional: 348] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 342, Positive conditional cache size: 0, Positive unconditional cache size: 342, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15 ], Independence queries for same thread: 7, Persistent sets #1 benchmarks: Persistent set computation time: 3.1s, Number of persistent set computation: 25, Number of trivial persistent sets: 23, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 348, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 370, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 363, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 363, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 363, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 348, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 348, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 3109, dependent conditional: 0, dependent unconditional: 3109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 369, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 348, unknown conditional: 0, unknown unconditional: 348] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 342, Positive conditional cache size: 0, Positive unconditional cache size: 342, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 15, independent unconditional: 342, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 348, independent: 342, independent conditional: 0, independent unconditional: 342, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 348, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 3109, dependent conditional: 0, dependent unconditional: 3109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 369, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 348, unknown conditional: 0, unknown unconditional: 348] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 342, Positive conditional cache size: 0, Positive unconditional cache size: 342, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15 ], Independence queries for same thread: 7 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-16 08:46:12,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Ended with exit code 0 [2024-10-16 08:46:12,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2024-10-16 08:46:12,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 Received shutdown request...